GATE | GATE-CS-2015 (Mock Test) | Question 10

The increasing order of following functions in terms of asymptotic complexity is:

(A) f1(n); f4(n); f2(n); f3(n)
(B) f1(n); f2(n); f3(n); f4(n);
(C) f2(n); f1(n); f4(n); f3(n)
(D) f1(n); f2(n); f4(n); f3(n)


Answer: (D)

Explanation: Source: http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/assignments/MIT6_006F11_ps1.pdf

Quiz of this Question

My Personal Notes arrow_drop_up

Save