In order to study an algorithm's performance, computer scientists ask how its performance changes as the size of the problem changes.
- CHAPTER 1: Algorithm Basics
- from Essential Algorithms: A Practical Approach to Computer Algorithms
- Publisher: John Wiley & Sons
- Released: August 2013
so instead of using absolute running time, we use the character of growth to evaluate an algorithm's performance
Share this highlighthttp://www.safaribooksonline.com/a/essential-algorithms-a/12581503/