Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4? f1 (n) = 2n; f2 (n) = n3/2; f3 (n) = nlog2n; f4 (n) = nlog2n

Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4? f1 (n) = 2n; f2 (n) = n3/2; f3 (n) = nlog2n; f4 (n) = nlog2n Correct Answer <p>f<sub>3</sub><sub> </sub>f<sub>2</sub> f<sub>4</sub><sub> </sub>f<sub>1</sub></p>

Let n = 1024

f1 (n) = 21024

f2 (n) = 215

f3 (n) = 10*210

f4 (n) = 102410 = 2100

f3 f2 f4 f1 is the required increasing order.

Related Questions