Playground

Landau Ranker

Compare growth-rate functions visually and rank them from slowest to fastest-growing. Each function is auto-classified into a Big-O class.

f∈O(g)  ⟺  ∃c,n0. ∀n≥n0. f(n)≤c⋅g(n)f \in O(g) \iff \exists c, n_0.\ \forall n \ge n_0.\ f(n) \le c \cdot g(n)
Growth chart (log-log)
log nsqrt(n)nn*log(n)n^2n^32^nn!
Add function
Syntax: n, numbers, + - * / ^, log(n), sqrt(n), parentheses.
Ranking (at n=64)
  1. 1.log nO(log n)
  2. 2.sqrt(n)—
  3. 3.nO(n)
  4. 4.n!O(n!)
  5. 5.n*log(n)O(n log n)
  6. 6.n^2O(n2)
  7. 7.n^3O(n3)
  8. 8.2^nO(2^n)