# Space Time Complexity
How much time does this algorithm need to finish? How much space do I need to run this algorithm? What is the relation between input size and time it takes to finish?
Asymptotic Notation to represent standardised way to gauging algorithms performance Big-O Notation - worst case scenarios Fit approximation
How time scales with respect to some input variables
Frequently seen symbols,
| Symbols | Interpretation |
|---|---|
| constant time this is what everybody wants | |
| Logarithmic time | |
| Linear time | |
| Linearithmic time | |
| Quadratic time | |
| Cubic time | |
| Exponential time, | |
| Factorial time |
# Big-O Properties
Depends on most dominant term in the function