| 词条 | Algorithms + Data Structures = Programs |
| 释义 |
| name = Algorithms + Data Structures = Programs[1] | image = | caption = | author = Niklaus Wirth | title_orig = | translator = | illustrator = | cover_artist = | country = | language = | series = | subject = programming, algorithms and data structures | genre = Non-fiction | publisher = | pub_date = 1976 | english_pub_date = | media_type = | pages = | isbn = | oclc = | dewey = | congress = | preceded_by = | followed_by = }} 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
References1. ^1 {{cite book|publisher=Prentice-Hall|year=1976|title=Algorithms + Data Structures = Programs|last=Wirth|first=Niklaus|id=0130224189|isbn=978-0-13-022418-7|url=http://portal.acm.org/citation.cfm?id=540029}} 2. ^Citations collected by the ACM External links
4 : Computer programming books|History of computing|Computer science books|1976 books |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。