Why do we use asymptotic notation in the study of algorithm?
Answers
Answered by
7
Asymptotic Notations, also known as 'algorithm’s growth rate' are languages which allow analyzing the running time of an algorithm. This is calculated by identifying its behavior as the input size for the algorithm changes.
Asymptotic analysis of an algorithm refers to defining the mathematical boundation or the framing of its run-time performance.
By using asymptotic analysis, the best case, average case, and worst case scenario of an algorithm can be concluded.
Asymptotic analysis of an algorithm refers to defining the mathematical boundation or the framing of its run-time performance.
By using asymptotic analysis, the best case, average case, and worst case scenario of an algorithm can be concluded.
Similar questions