GATE 2005-IT
October 12, 2023GATE 2021 CS-Set-2
October 12, 2023Algorithms
| Question 49 |
Let T(n) be a function defined by the recurrence T(n) = 2T(n/2) + √n for n ≥ 2 and T(1) = 1 Which of the following statements is TRUE?
| T(n) = θ(log n) | |
| T(n) = θ(√n) | |
| T(n) = θ(n) | |
| T(n) = θ(n log n) |
Question 49 Explanation:
Apply Master’s theorem.
Correct Answer: C
Question 49 Explanation:
Apply Master’s theorem.