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

  1. A.

    Θ(√n)

  2. B.

    Θ(n log n)

  3. C.

    Θ(√n log n)

  4. D.

    Θ(n log √n)

Attempted by 336 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…