engineering recuitment ISRO Scientist Computer Science Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Consider the following functions from positives integers to real numbers
1000, log2 n, √n, 1000/√n,
The correct arrangement of the above functions in descending order of asymptotic complexity is:
1
log2 n, √n, 1000, 1000/√n
2
√n, log2 n, 1000, 1000/√n
3
√n, log2 n, 1000/√n, 1000
4
log2 n, √n, 1000/√n, 1000