
15.6 Chapter Summary 1143
SUMMARY
On the CD-ROM included with this book,you will find a Flash movie with a step-by-step illustration
of how to compute running times for various methods.Click on the link for Chapter 15 to start the
movie.
CODE IN ACTION
The analysis of the running time of Quick Sort is the subject of the Group
Project for this chapter.
15.6 Chapter Summary
■
The running time of an algorithm is expressed as a function of its
inputs or its number of inputs.
■
Orders of magnitude are, in increasing order of execution time:
constant, log, polynomial, and exponential. Exponential running
times are undesirable.
■
Big-Oh notation is the industry standard ...