Polynomial Time
$$S = f(N)$$
Where
- $S$ is the steps taken to solve a problem
- $N$ is size of the problem
Polinomial function: $N^2+3N+7$
Examples
- $n$: linear search
- $log(n)$: binary search
- $n*log(n)$: merge sort
- $n^2$: insertion sort
- $n^3$: matrix multiplication