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.
 | |
| Author | Niklaus Wirth |
|---|---|
| Subject | programming, algorithms and data structures |
| Genre | Non-fiction |
Publication date | 1976 |
| Pages | 392 |
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.[2]
The Turbo Pascal compiler written by Anders Hejlsberg was largely inspired by the Tiny Pascal compiler in Niklaus Wirth's book.
Chapter outline
editSee also
editReferences
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.
  | This article about a computer book or series of books is a stub. You can help Wikipedia by expanding it. |