In mathematical analysis, asymptotic analysis of algorithm is a method of defining the mathematical boundation of its run-time performance. Using the asymptotic analysis, we can easily conclude about the average case, best case and worst case scenario of an algorithm.
It is used to mathematically calculate the running time of any operation inside an algorithm.
the time required by an algorithm comes under three types:
Worst case: It defines the input for which the algorithm takes the huge time.
Average case: It takes average time for the program execution.
Best case: It defines the input for which the algorithm takes the lowest time.
Asymptotic Notations
| constant |
- |
?(1) |
| linear |
- |
?(n) |
| logarithmic |
- |
?(log n) |
| n log n |
- |
?(n log n) |
| exponential |
- |
2?(n) |
| cubic |
- |
?(n3) |
| polynomial |
- |
n?(1) |
| quadratic |
- |
?(n2) |
