When n = 22k for some k ≥ 0, the recurrence relation T(n) = √(2) T(n/2) + √n,…
GATE · 2008 · IT
When n = 22k for some k ≥ 0, the recurrence relation
T(n) = √(2) T(n/2) + √n, T(1) = 1
evaluates to :
- A.
√(n) (log n + 1)
- B.
√(n) (log n )
- C.
√(n) log √(n)
- D.
n log √(n)
Attempted by 107 students.
Sign up free to check your answer
Sign up freeLoading lesson…