Big Oh Complexity

Big Oh Notation is used to describe the UPPER BOUND of a function.

Big Oh is always the fastest growing component of a function, so, O(n) + O(n!) = O(n!) O(n) + O(n) = O(n)

The names for each type of Big Oh are as such $Constant-O(1)$

$$Logarithmic-O(\log n)$$

$Fractional-O(\sqrt{n})=O(n^{1/2})$

$$Linear-O(n)$$

$Quasilinear-O(n\log n)$ $Quadratic-O(n^2)$ $Cubic-O(n^3)$ $Exponential-O(2^n)$ $Factorial-O(n!)$