Which of the given options provides the increasing order of asymptotic complexity of function f1, f2, f3, f4? where
f1(n)=2^n a) f3, f2, f4, f1
f2(n)=n^3/2 b) f3, f2, f1, f4
f3(n)=nlogn c) f2, f3, f1, f4
f4(n)=n^logn d) f2, f3, f4, f1
The increasing order of asymptotic complexity of the functions is:
c) f2, f3, f1, f4
Explanation:
- f2(n) = n^(3/2)
- f3(n) = n*log(n)
- f1(n) = 2^n
- f4(n) = n^log(n)
From lowest to highest complexity:
f2, f3, f1, f4