Time Complexity

Question 1

Let T(n) be the function defined by T(1)= 1, T(n)= 2T(⌊n/2⌋) + √n for n≥2. Which of the following statement(s) is true?

A
T(n) = O(√n)
B
T(n) = O(n)
C
T(n) = O(log n)
D
None of the above
AlgorithmsTime ComplexityGATE 1997
Question 1 Explanation: 
Apply Master's theorem.
There is 1 question to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access