campus placement AMCAT Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Consider the following five functions:
f1 = 10n, f2 = n1/3, f3 = nn, f4 = log(logn), f5 = \({2^{\sqrt {\log n} }}\)
Then arrange the above functions in ascending order.1
f4,f5,f2,f1,f3
2
f5,f4,f2,f1,f3
3
f4,f5,f1,f2,f3
4
f5,f4,f2,f3,f1