Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
Consider the recurrence relation :
\(T(n) = 8T \left(\frac{n}{2}\right)+Cn, if \;n > 1\)
= b, if n = 1
Where b and c are constants.
The order of the algorithm corresponding to above recurrence relation is :
1
n
2
n2
3
n lg n
4
n3