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

PYQ GATE 2011

Which of the given options provides the increasing order of asymptotic complexity of functions f₁, f₂, f₃ and f₄?

f1(n)=2nf_1(n)=2^n

f2(n)=n3/2f_2(n)=n^{3/2}

f3(n)=nlog⁡2nf_3(n)=n\log_2 n

f4(n)=nlog⁡2nf_4(n)=n^{\log_2 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 460 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…