<span title="Home" class="fa-solid-900 icon"></span> Home

Ciro Santilli's Homepage

Technology

Area of technology

Information technology

Computer

Computer science

Computational problem

Complexity class

Big O notation family

{title2=$O(n)$}
{wiki}

Module bound above, possibly multiplied by a constant:
$$
f(x) = O(g(x))
$$
is defined as:
$$
\exists M > 0 \exists x_0  \forall x > x_0 \colon |f(x)| \leq M g(x)
$$

E.g.:
* $\forall c \in \R x + c = O(x)$. For $c < 0$, $M = 1$ is enough. Otherwise, any $M > 1$ will do, the bottom line will always catch up to the top one eventually.


Big O notation

Dense and sparse matrices

Little-o notation

Big O notation ( $O (n)$ )

 Ancestors (9)

 Incoming links (3)

 Discussion (0)

 Articles by others on the same topic (1)

Big O notation (O(n))

 Ancestors (9)

 Incoming links (3)

 Discussion (0)  Subscribe (1)

 Articles by others on the same topic (1)

Big O notation ( $O (n)$ )

 Discussion (0)