Subject | Algorithm Design |
---|---|

NU Year | Set: 1.(a) Marks: 5 Year: 2008 |

This is because of the analysis of algorithms tells some interesting thing about the algorithms in terms of performance. If we analyze the performance of the algorithm then we can say that the algorithm user friendliness, modularity, security, maintainability, etc. And also we can predict the speed and problem-solving capability of the algorithm.

And the major reason of analysis of algorithm is if we want to compare the performance of two algorithms to solve the same problem.

Then we can’t compare in a simple manner. Means if we want to compare them then we need to implement them and give input them and compare the speed of there. In this type of comparison if the input is different and the condition is different then we can’t compare accurately. So for this, we use **Asymptotic Analysis. **Using asymptotic analysis we can measure the performance of the algorithm in terms of their performance and speed to solve the problem.

So the Analysis of algorithm is important for knowing the capability of the algorithm. Here capability means it’s problem-solving, time to solve, the size required.