GATE | IT | 2008 | Algorithms | Recurrence | Question 42
Last Updated :
Discuss
Comments
When n = 22k for some k ≥ 0, the recurrence relation
T(n) = √(2) T(n/2) + √n, T(1) = 1
evaluates to :
√(n) (log n + 1)
√(n) (log n )
√(n) log √(n)
n log √(n)
This question is part of this quiz :
Top MCQs on Complexity Analysis using Recurrence Relations with Answers,Gate IT 2008Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy