InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
What is asymptotic analysis of an algorithm? |
|
Answer» 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. |
|