Order the functions by their Big-O time complexity.
order them by growth rate. such that the most slowly growing function comes first. If f(n) = theta(g(n)), put them on the same line)
2^(n), (2/5)n, 7n^(5) - n^(3) , log(n) , log(n^2) , log(log n) , 15^(451) ,
n/log n ,n + 50 log n, ln(n), n! , 2^(log n)
i'm not sure of my ordering
1)15^(451)
2)log(log n)
3)log(n) and log(n^2)
4)ln(n)
5)n/log n
6)(2/5)n and n + 50 log n
7)7n^(5) - n^(3)
8)n!
9)2^(log n)
10)2^(n)