Asymptotic analysis is a technique to measure the order of growth of time taken by a program based on the input size.
Key points to understand asymptotic analysis
- It does not depend on the programing languages, machine performance and any test cases. In asymptotic analysis, we don’t need to implement. We can just analyze the algorithm based on the order of growth.
- We can compare two or more functions with different input sizes and can analyze which is better and efficient solution for us.
- The most and important part to remember is, the time complexity of an algorithm should not be negative value which simply means the value should be zero (0) or higher.
In this post, we learn what is asymptotic analysis. To understand it better first we need to learn the Order of growth of an algorithm and Asymptotic notations.