Algorithms + Data Structures = Programs

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.

Algorithms + Data Structures = Programs[1]
AuthorNiklaus Wirth
Subjectprogramming, algorithms and data structures
GenreNon-fiction
Publication date
1976
Pages392

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
  • 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

See also

References
  1. Wirth, Niklaus (1976). Algorithms + Data Structures = Programs. Prentice-Hall. ISBN 978-0-13-022418-7. 0130224189.
  2. Citations collected by the ACM


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.