# Asymptotics - Time Compacity #### Big-Oh Notation t(n) < C*g(n) #### Big-Omega (lower bounds) t(n) > C*g(n) #### Big-Theta (exact) C1*g(n) <= t(n) <= C2*g(n) --- ![](https://i.imgur.com/2MvEK5e.png) --- ##### 參考資源： 1. 解釋什麼是時間複雜度O(n) https://www.youtube.com/watch?v=__vX2sjlpXU&ab_channel=MichaelSambol 3. O(n)、Ω(n)、Θ(n)差別及證明 https://www.youtube.com/watch?v=iMj2-nGfaXk&ab_channel=%E6%B4%AA%C3%82ng%E6%98%A5%E7%94%B7Chhun-L%C3%A2m