Question

Which of the given options provides the increasing order of asymptotic complexity of function f1, f2, f3, f4? where

f * 1(n) = 2 ^ n

a) f3, f2, f4, f1

f * 2(n) = n ^ (3/2)

b) f3, f2, f1, f4

f * 3(n) =n logn

c) f2, f3, f1, f4

⚫ f * 4(n) =n^ logn

d) f2, f3, f4, f1

Answer 1

The increasing order of asymptotic complexity of the given functions is:

c) f2, f3, f1, f4

Explanation:
- f2(n) = n^(3/2) grows slower than f3(n) = n logn, so f2 is before f3.
- f3(n) = n logn grows slower than f1(n) = 2^n, so f3 is before f1.
- f1(n) = 2^n grows slower than f4(n) = n^logn, so f1 is before f4.

Therefore, the correct order is f2, f3, f1, f4.