Asymptotic analysis is used to measure the efficiency of an algorithm that doesn't depend on machine-specific constants and prevents the algorithm from comparing the time taking algorithm. Asymptotic notation is a mathematical tool that is used to represent the time complexity of algorithms for asymptotic analysis.

Time complexity: Time complexity is a Running time of a program as a function of the size of the input.

• The three most used asymptotic notation is as follows.

1.  θ Notation
2.  Big O Notation
   
3.  Ω Notation