Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs is written by Niklaus Wirth covering some of the fundamental topics of system engineering, computer programming, particularly that algorithms and data structures are inherently related. For example, if one has a sorted list one will use a search algorithm optimal for sorted lists. The book was one of the most influential computer science books of the time and, like Wirth’s other work, was extensively used in education. The Turbo Pascal compiler written by Anders Hejlsberg was largely inspired by the Tiny Pascal compiler in Niklaus Wirth’s book.

Table of Contents

1 FUNDAMENTAL DATA STRUCTURES

2 SORTING

3 RECURSIVE ALGORITHMS

4 DYNAMIC INFORMATION STRUCTURES

5 LANGUAGE STRUCTURES AND COMPILERS

APPENDICES

A THE ASCII CHARACTER SET

B PASCAL SYNTAX DIAGRAMS

About the Author

Niklaus Emil Wirth (born 15 February 1934) is a Swiss computer scientist. He has designed several programming languages, including Pascal, and pioneered several classic topics in software engineering. In 1984, he won the Turing Award, generally recognized as the highest distinction in computer science, for developing a sequence of innovative computer languages.