Personal website Rudolf Adamkovič

Home / Computer science


Order of growth

A function that

asymptotically describes growth rate,

notably in Big O notation:

\(\mathcal{O}(1)\)
constant
\(\mathcal{O}(\log n)\)
logarithmic
\(\mathcal{O}(n)\)
linear
\(\mathcal{O}(n \log n)\)
log-linear
\(\mathcal{O}(n^2)\)
quadratic
\(\mathcal{O}(n^3)\)
cubic
\(\mathcal{O}(n^c)\)
polynomial
\(\mathcal{O}(c^n)\)
exponential
\(\mathcal{O}(n!)\)
factorial

where

  • \(n\) is the input size
  • \(c\) is a constant.

© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.