Summary

Progressing from the concrete to the abstract, and using a number of case studies and sample programs, this text explores structured problem solving, data abstraction, software engineering principles, and the comparative analysis of algorithms as fundamental tools of program design. This edition aims to strengthen the documentation by including informal specification (pre- and post-conditions) with all subprograms. It treats recursion much earlier and emphasizes it repeatedly throughout, also revising all programs to emphasize data abstraction, to develop and employ reusable code, and to strengthen uniformity and elegance of style. New topics covered include splay trees, red-black trees, and amortized algorithm analysis. There are also new case studies, new exercises and programming projects, and Internet access to the source code for all the programs and program extracts printed in the text.