Big Θ


$$\Theta(g(n)) = O(g(n)) \cap  \Omega(g(n))$$
### satisfy both upper bound and lower bound
After a certain point the requirement matches, we can say Big θ
$\Theta(n^2) = \Theta(1000n^2)$ theoretically but practically, it matters
### Big θ Notion
|Title|
|:-:|



> [Big-θ (빅 세타) 표기법  (개념 이해하기) | 알고리즘 | Khan Academy](https://ko.khanacademy.org/computing/computer-science/algorithms/asymptotic-notation/a/big-big-theta-notation)

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





