Big O


### Non-tight Upper bound
We write $f(n) = O(g(n))$ if there exist constants $c>0, n_0>0$ such that $0 \le f(n) \le cg(n)$ for all $n \ge n_0$
### Big O Notion
|Title|
|:-:|
|[Time Complexity](https://texonom.com/time-complexity-cd2b4611ca52442fa7a77c1af0f91b2f)|
|[Space Complexity](https://texonom.com/space-complexity-d873465dea934141a0edfd11c6df65c5)|




> [시간 복잡도 (big-O, big-Ω, big-θ)](https://velog.io/@wan088/시간-복잡도-big-O-big-big-)





