Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3, and f4?
f1(n) = 2n f2(n) = n(3/2) f3(n) = n*log(n) f4(n) = nlog(n)
f3, f2, f4, f1
f3, f2, f1, f4
f2, f3, f1, f4
f2, f3, f4, f1
This question is part of this quiz :
Top MCQs on Complexity Analysis of Algorithms with Answers