Which of the given options provides the increasing order of asymptotic…

2011

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

f₁(n) = 2ⁿ
f₂(n) = n(3/2)
f₃(n) = n log n
f₄(n) = n(log n)

  1. A.

    f₃, f₂, f₄, f₁

  2. B.

    f₃, f₂, f₁, f₄

  3. C.

    f₂, f₃, f₁, f₄

  4. D.

    f₂, f₃, f₄, f₁

Attempted by 82 students.

Show answer & explanation

Correct answer: A

Step-1: Compare growth rates

1. n log n

Grows slightly more than linear → smallest here.

2. n^1.5

Polynomial with power 1.5 → faster than n log n.

3. n^(log n)

This is super-polynomial but sub-exponential
because
n^(log n) = e^(log² n)

It grows faster than any n^k but slower than 2ⁿ.

4. 2ⁿ

Pure exponential → largest growth.

Final Increasing Order

f₃(n) = n log n
< f₂(n) = n^1.5
< f₄(n) = n^(log n)
< f₁(n) = 2ⁿ

Correct Option → A

A. f₃, f₂, f₄, f₁

A video solution is available for this question — log in and enroll to watch it.

Explore the full course: Gate Guidance By Sanchit Sir