0
1.6kviews
Explain the asymptotic notations
written 7.2 years ago by | • modified 7.2 years ago |
Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm
Marks: 10M
Year: Dec 2016
ADD COMMENT
EDIT
1 Answer
written 7.2 years ago by | • modified 7.2 years ago |
Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm
Marks: 10M
Year: Dec 2016
written 7.2 years ago by |
Asymptotic analysis of an algorithm refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case, and worst case scenario of an algorithm.
Asymptotic analysis is input bound i.e., if there's no input to the algorithm, it is …