Time complexity for the recursive relation T(n) = 2T(√n) + 1 is:

2025

Answer: D. θ (log n)

1. A.

   θ (n log n)

2. B.

   θ (n)

3. C.

   θ (n2)

4. D.

   θ (log n)

Attempted by 188 students.