Algorithms + data structures=programs. Data Structures and Efficient Algorithms. Data structures and network algorithms. Algorithms and Data Structures in C:Preface Algorithms and Data Structures in C by Alan Parker CRC Press, CRC Press. This free book surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm that we address by examining its impact on specific applications. free book at FreeComputerBooks.com.
Author | Niklaus Wirth |
---|---|
Subject | programming, algorithms and data structures |
Genre | Non-fiction |
1976 |
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, 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[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]
- ^ abWirth, Niklaus (1976). Algorithms + Data Structures = Programs. Prentice-Hall. ISBN978-0-13-022418-7. 0130224189.
- ^
External links[edit]
- ETH Zurich / N. Wirth / Books / Compilerbau: Algorithms + Data Structures = Programs (archive.org link)
Retrieved from 'https://en.wikipedia.org/w/index.php?title=Algorithms_%2B_Data_Structures_%3D_Programs&oldid=839710603'