Big Ω


### Non-tight Lower bound
We write $f(n) = O(g(n))$ if there exist constants $c>0, n_0>0$ such that $0 \le cg(n) \le f(n) $ for all $n \ge n_0$



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





