Algorithms + Data Structures = Programs
From Wikipedia, the free encyclopedia
Algorithms + Data Structures = Programs[1] is a 1976 book written by Niklaus Wirth covering some of the fundamental topics of 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, extensively used in education[citation needed].
The Turbo Pascal compiler written by Anders Hejlsberg was largely inspired by the "Tiny Pascal" compiler in Niklaus Wirth's book.
Chapter outline [edit]
- Chapter 1 - Fundamental Data Structures
- Chapter 2 - Sorting
- Chapter 3 - Recursive Algorithms
- Chapter 4 - Dynamic Information Structures
- Chapter 5 - Language Structures and Compilers
- Appendix A - the ASCII character set
- Appendix B - Pascal syntax diagrams
References [edit]
- ^ Wirth, Niklaus (1976). Algorithms + Data Structures = Programs (in English). Prentice-Hall. ISBN 978-0-13-022418-7. 0130224189.
External links [edit]
  |
This article about a computer book or series of books is a stub. You can help Wikipedia by expanding it. |
