Personal website Rudolf Adamkovič

Home / Computer science


Big O

A notation for asymptotic complexity where

\begin{equation*} f(n) = \mathcal{O}(g(n)) \end{equation*}

denotes the fact

\(f(n)\) grows on the order of \(g(n)\).



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