Algorithms & Data Structures

Abstract

• Pascal has been replaced by Modula-2.
• The last part of Chapter 1 is dedicated to searching.
• A section on priority search trees completes the chapter on dynamic data structures.
• The book reflects the development of the use of computers and sophisticated algorithms to prepare and automatically typeset documents.
• The syntax of Modula-2 is summarized in the Appendix for easy reference.

This lucid, systematic, and penetrating tretment of basic and dynamic data structures, sorting, recursive algorithms, language structures, and compiling shows how these basic principles are applicable to any scientific and engineering area.

Among its features, the book:

• develops programs in step-wise fashion and expresses them in a well structured detailed and unambiguous presentation
• stresses the importance of performance analysis and demonstrates how algorithm selection and refinement are used most effectively in program design
• presents thoroughly-tested illustrative programs