How to rank these functions in increasing order of complexity [Algorithms]?
I solved it after understanding asymptotic notation and the complexity of some common functions. Here's the order from least expensive to most expensive:


  log log n, log n ~ ln n, (log n)^2, sqrt(n), n, n log n, n^(1+x), n^2,
  n^3, n-n^3+7n^5, 2^(n-1) ~ 2^n, e^n, n!