O(Θ),O(), O(Ω)

Rate of Growth in regards with input of n (Big Order of growth notation):

Asymptotically Tight Bound (Θ) :

Big O(Θ) is noted to give us the upper (max) bound (worst case scenario , with the largest constant k1) and a lower (min) bound (best case scenrio) as well with the smallest constant k2.

Asymptotically Upper Bound – O$)$ :

Big O() is noted to give us the upper (max) bound (worst case scenario , with the largest constant k1).

Asymptotically Lower Bound –  O($\Omega )$ :

Big O($\Omega$) is noted to give us the lower (min) bound (best case scenrio) well with the smallest constant k2.