Multiple Choice
Which of the following is the Big-Oh of this function: T(n) = T(n / 2k) + 5 * k?
A) O(log n)
B) O(n)
C) O(n2)
D) O(n log n)
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q28: Using the following code segment could help
Q29: If n = 10 and the order
Q30: What is the typical running time of
Q31: Running times represented using the Big-Oh notation
Q32: Most programmers tend to disregard _ when
Q34: Which of the following will result in
Q35: The pattern T(n) = 2<sup>k</sup> T(n /
Q36: What is the best-case running time of
Q37: In terms of Big-Oh notation, a running
Q38: What is the Big-Oh of the function