GATE Computer Science (CS) 2011 Solved Paper
© examsiri.com
Question : 47 of 65
Marks:
+1,
-0
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) = n log2 n f4(n) = nlog2n
f1(n) = 2n f2(n) = n3/2 f3(n) = n log2 n f4(n) = nlog2n
Go to Question: