百科
这个词条暂时没有中文维基百科条目,下面是英文维基百科的内容(英文原文):
Algorithms + Data Structures = Programs 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.
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
Later editions
A revised edition was published in 1985 with the title Algorithms and Data Structures, 288 pages. It used Modula-2 instead of Pascal. There is a later version available in digital form which uses Oberon. Chapter 5 has been replaced with a chapter titled "Key Transformations (Hashing)".
以上文字摘自英文维基百科「Algorithms + Data Structures = Programs」(去掉了参考文献等尾部小节),按 CC BY-SA 4.0 使用,作者为维基百科的各位编者。
资料卡
- 原题
- Algorithms + Data Structures = Programs
- 原作语言
- 英语
- 首次出版
- 1976 年
- 体裁
- 非虚构作品
- 主题
- 算法、数据结构、计算机程序设计
资料卡来自 Wikidata Q4724373(CC0),众包数据,个别字段可能不全。
