Algorithms + Data Structures = Programs

✍ Scribed by Niklaus Wirth

• Publisher: PRENTICE HALL
• Year: 1976
• Tongue: English
• Leaves: 380
• Series: Prentice-Hall series in automatic computation
• Category: Library

✦ Synopsis

Algorithms + Data Structures = Programs presents a very systematic and scientific approach to the fundamental techniques associated with data composition and program development. The basic principles covered here are applicable to many scientific and engineering endeavors.

Contents include chapters devoted to fundamental data structures, internal and external sorting, recursive algorithms, dynamic data structures (recursive data types, pointers, list structures, tree structures, optimal search trees, multiway trees, and key transformations), and language structures and compiling (language definition and analysis, syntax graphs, parser and translatorconstruction).

Among the Features

* Covers important basic techniques of program and data structuring and demonstrates their suitability to a wide variety of practical applications.

* 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 illustrative programs that were run and thoroughly tested before their inclusion here.

* Practically oriented, employs the minimum required mathematical formalism.

✦ Subjects

ELECTRONIC DIGITAL COMPUTERS -- PROGRAMMING;DATA STRUCTURES (COMPUTER SCIENCE);ALGORITHMS