Algorithm complexity representation

Notation	bound	notes
$O(n)$	upper bound tight	most common
$\Theta (n)$	upper and lower tight	most accurate
$\Omega(n)$	lower bound tight
$o(n)$	upper bound loose
$\omega(n)$	lower bound loose