Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
f1 = 2n, f2 = nlgn, f3 = \(n^\sqrt{n}\), f4 = n2
1
f4, f3, f2, f1
2
f2, f3, f1, f4
3
f3, f2, f1, f4
4
f4, f2, f3, f1
5
Question Not Attempted