Algorithms + Data Structures = Programs
From Wikipedia, the free encyclopedia
1976 book by Niklaus Wirth
| Author | Niklaus Wirth |
|---|---|
| Subject | programming, algorithms and data structures |
| Genre | Non-fiction |
Publication date | 1976 |
| Pages | 392 |
Algorithms + Data Structures = Programs[1] is a 1976 book 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 is one of the most influential computer science books of its time and, like Wirth's other work, has been used extensively in education.[2]
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 ]- ^ a b Wirth, Niklaus (1976). Algorithms + Data Structures = Programs . Prentice-Hall. ISBN 978-0-13-022418-7. 0130224189.
- ^ Citations collected by the ACM
External links
[edit ]- ETH Zurich / N. Wirth / Books / Compilerbau: Algorithms + Data Structures = Programs (archive.org link)
- N. Wirth, Algorithms and Data Structures (1985 edition, updated for Oberon in August 2004. Pdf at ETH Zurich) (archive.org link)
- Wirth, Niklaus (2004) [updated 2014]. Algorithms and Data Structures (PDF). Oberon version with corrections and authorized modifications. Institute for Nuclear Research, Moscow: Fyodor Tkachov.
Stub icon 1 Stub icon 2
This article about a computer book or series of books is a stub. You can help Wikipedia by expanding it.