Complexity Ordering

Order, starting with 1, the following algorithm complexities from fastest to slowest based on their Big O assignment by putting their Rank in the Rank. Assume n is the size of the data. E.g., O(n) would be faster than O(n¹⁰⁰). So, O(n) would be 1 and O(n¹⁰⁰) would be 2. Assume log is log base 2 and that e is the base of the natural logarithms. If one or more are equivalent, give them the same rank.

Complexity: O( )	Rank
n3
n2 log(n)
n
n!
log(n)
nn
en
ne
elog(n)
log(n)log(n)
e