Question: What is the time complexity of this function? howBig(n) 1 i = 0 2 while n > 1 3 n = floor(n / 2) 4
What is the time complexity of this function?
howBig(n) 1 i = 0 2 while n > 1 3 n = floor(n / 2) 4 i = i + 1 5 return i
- A. (lg n)
- B. (n)
- C. (n lg n)
- D. (n^2)
- E. (n^3)
- F. (2^n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
