Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
What is the solution of given recurrence relation?
T(n) = T(n/2) + c when n > 1 and T(n) = 1 when n = 1 where ‘c’ is a constant.
1
O(n)
2
O(n logn)
3
O(logn)
4
O(n2)
5
Question Not Attempted