The tight asymptotic bound for the recurrence T(n) = 2T(n/4) + √n is
UGC NET 2025
The tight asymptotic bound for the recurrence T(n) = 2T(n/4) + √n is
- A.
Θ(√n)
- B.
Θ(n log n)
- C.
Θ(√n log n)
- D.
Θ(n log √n)
Attempted by 336 students.
Sign up free to check your answer
Sign up freeLoading lesson…

