Asymptotic Notation

A way of describing the runtime of a program/algorithm

$\Omega (n)$ → $f(n)\ge cn$ $\theta (n)$ → $f(n)=cn$ $O(n)$ → $f(n)\le cn$ where $n\ge 1$ and $c\ge 1$