Math — Big-O Complexity
Ordering common growth rates.
Rendering…
Make it your own.
O(1) < O(\log n) < O(n) < O(n\log n) < O(n^2) < O(2^n)
T(n) = O(f(n))
\text{worst-case growth rate}
\text{drop constants and lower-order terms}
Ordering common growth rates.
O(1) < O(\log n) < O(n) < O(n\log n) < O(n^2) < O(2^n)
T(n) = O(f(n))
\text{worst-case growth rate}
\text{drop constants and lower-order terms}