Asymptotic notation describes
the algorithm efficiency and performance in a meaningful way. It describes the
behavior of time or space complexity for large instance characteristics.
3 types of Asymptotic notation
i). Big Oh
notation(O)
ii).Big Omega
notation(Ω)
iii).Big Theta
notation(θ)