Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) 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?
A. f1(n) = 2n
B. f2(n) = n3/2
C. f3(n) = n log n
D. f4(n) = nlog n
Choose the correct answer from the options given below
1
C, B, D, A
2
C, B, A, D
3
B, C, A, D
4
B, C, D, A