Algorithms | Analysis of Algorithms | Question 6
February 8, 2013
Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4?
f1(n) = 2^n f2(n) = n^(3/2) f3(n) = nLogn f4(n) = n^(Logn)
(A) f3, f2, f4, f1
(B) f3, f2, f1, f4
(C) f2, f3, f1, f4
(D) f2, f3, f4, f1
Answer:(A)
Explanation:
Quiz of this Question
Related Questions:
- Algorithms | Recursion | Question 9
- Algorithms | Analysis of Algorithms | Question 19
- Algorithms | Graph Shortest Paths | Question 15
- Algorithms | Graph Shortest Paths | Question 14
- Algorithms | Graph Shortest Paths | Question 13
- Algorithms | Graph Shortest Paths | Question 12
- Algorithms | Misc | Question 15
- Algorithms | Graph Traversals | Question 12
Tweet
- faizan
- GeeksQuiz