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

  1. A.

    O(n log log log n)

  2. B.

    O(n log log n)

  3. C.

    O(log log n)

  4. D.

    O(log n log log n)

Attempted by 9 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…