Rank these time bounds in increasing order of growth:
I'm working on a computer science question and need support to help me study.
(0) 4^{log n}
(1) n^{2.5}
(2) n!
(3) 5^n
(4) 2^{n^2}
(5) log log n
(6) n^4
(7) 2^{2^n}
(8) n^2 log n
(9) 1
(10) n^{log log n}
(11) log^2 n
(12) n 2^n
(13) sqrt{log n}
(14) n^{log n} (15) 2
Sample Solution