engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
The running time of an algorithm T(n), where ‘n’ is the input size, is given by
T(n) = 8T (n/2) + qn, if n > 1
= p, if n = 1
Where p, q are constants. The order of this algorithm is1
n2
2
nn
3
n3
4
n