Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
Consider the below recurrence:
T(n) = 9. T(n/3) + n2.5
What is the tight bound for the given recurrence?
1
Θ(n2)
2
Θ(n)
3
Θ(n2.5)
4
Θ(2n)
5
Question Not Attempted