Which of the given options provides the increasing order of asymptotic complexity of f1, f2, f3 f4 functions and ? f1(n) = 2n A. f2(n) = n3/2 B. f3(n) = n log n C. f4(n) = nlog n D.

1. AC, B, D, A
2. BC, B, A, D
3. CB, C, A, D
4. DB, C, D, A B+

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: A. C, B, D, A

Explanation

n log n < n^(3/2) < n^(log n) < 2ⁿ (n^(log n) = 2^((log n)²) grows slower than 2ⁿ). So C, B, D, A.