What is the time complexity of given recurrence relation

What is the time complexity of given recurrence relation

  1. A.

    O(log2n)

  2. B.

    O(log2n log2n)

  3. C.

    O(n)

  4. D.

    O(log2n log2 log2n)

Attempted by 206 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…