The most straightforward reason for analyzing an algorithm is to discover its characteristics in order to evaluate its suitability for various applications or compare it with other algorithms for the same application. The characteristics of interest are most often the primary resources of time and space, particularly time. Put simply, we want to know how long an implementation of a particular algorithm will run on a particular computer, and how much space it will require. We generally strive to keep the analysis independent of particular implementations—we concentrate instead on obtaining results for essential characteristics of the algorithm that can be used to derive precise estimates of true resource requirements on various a...
- Chapter One. Analysis of Algorithms
- from An Introduction to the Analysis of Algorithms, Second Edition
- Publisher: Addison-Wesley Professional
- Released: January 2013
Very good information
Share this highlighthttp://www.safaribooksonline.com/a/an-introduction-to/72380/