The solution of recurrence relation, T(n) = 2T(floor(√n)) + log n is
UGC NET 2013
The solution of recurrence relation, T(n) = 2T(floor(√n)) + log n is
- A.
O(n log log log n)
- B.
O(n log log n)
- C.
O(log log n)
- D.
O(log n log log n)
Attempted by 9 students.
Sign up free to check your answer
Sign up freeLoading lesson…

