Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
f1 (n) = 2n; f2 (n) = n3/2; f3 (n) = nlog2n; f4 (n) = nlog2n
1
f3 f2 f4 f1
2
f3 f2 f1 f4
3
f2 f3 f1 f4
4
f2 f3 f4 f1
5
Question Not Attempted