As we are very well aware that
the analysis of the algorithms is done by the calculating its time complexity
and space complexity. Talking about the time complexity which is represented by
asymptotic notations such as Big-Oh, Theta and Omega notations. This is
kind of analysis of algorithms is often called as asymptotic analysis of
algorithms. Basically using these notations we try to find the rate of
growth of algorithms when the input size n increases say to infinity. We
try to find how the time complexity will behave when the input
to an algorithm increases.
