Question

Which of the given options provides the increasing order of asymptotic complexity of function f1, f2, f3, f4? where
f1(n)=2n a) f3, f2, f4, f1
f2(n)=n3/2 b) f3, f2, f1, f4
f3(n)=nlogn c) f2, f3, f1, f4
f4(n)=nlogn d) f2, f3, f4, f1

Answer 1

The correct order of increasing asymptotic complexity for functions f1, f2, f3, f4 is:

c) f2, f3, f1, f4

Explanation:
- f2(n) = n^(3/2) has the highest complexity as it grows faster than all other functions.
- f3(n) = nlogn has the next highest complexity after f2.
- f1(n) = 2n has lower complexity compared to f2 and f3.
- f4(n) = nlogn grows at the slowest rate among all functions.