Number-Systems
November 12, 2024UGC NET CS 2008-june-Paper-2
November 13, 2024Algorithms
| Question 39 |
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?
| T(n) = O(√n) | |
| T(n) = O(n) | |
| T(n) = O(log n) | |
| None of the above |
Question 39 Explanation:
Apply Master’s theorem.
Correct Answer: B
Question 39 Explanation:
Apply Master’s theorem.
Subscribe
Login
0 Comments