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)\).
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)\).