Saved Bookmarks
| 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. 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. |
|