Back فن برمجة الحاسوب Arabic The Art of Computer Programming Catalan Umění programování Czech The Art of Computer Programming German Η Τέχνη του Προγραμματισμού Υπολογιστών Greek The Art of Computer Programming Spanish هنر برنامهنویسی رایانه Persian The Art of Computer Programming French The Art of Computer Programming Croatian Համակարգչային ծրագրավորման արվեստը Armenian
 The Art of Computer Programming, Volume 1: Fundamental Algorithms | |
| Author | Donald Knuth |
|---|---|
| Language | English |
| Genre | Non-fiction Monograph |
| Publisher | Addison-Wesley |
Publication date | 1968– (the book is still incomplete) |
| Publication place | United States |
| Media type | Print (Hardcover) |
| ISBN | 0-201-03801-3 |
| 519 | |
| LC Class | QA76.75 |
The Art of Computer Programming (TAOCP) is a comprehensive multi-volume monograph written by the computer scientist Donald Knuth presenting programming algorithms and their analysis. As of 2025[update] it consists of published volumes 1, 2, 3, 4A, and 4B, with more expected to be released in the future. The Volumes 1–5 are intended to represent the central core of computer programming for sequential machines; the subjects of Volumes 6 and 7 are important but more specialized.[1]
When Knuth began the project in 1962, he originally conceived of it as a single book with twelve chapters. The first three volumes of what was then expected to be a seven-volume set were published in 1968, 1969, and 1973. Work began in earnest on Volume 4 in 1973, but was suspended in 1977 for work on typesetting prompted by the second edition of Volume 2. Writing of the final copy of Volume 4A began in longhand in 2001, and the first online pre-fascicle, 2A, appeared later in 2001.[2] The first published installment of Volume 4 appeared in paperback as Fascicle 2 in 2005. The hardback Volume 4A, combining Volume 4, Fascicles 0–4, was published in 2011. Volume 4, Fascicle 6 ("Satisfiability") was released in December 2015; Volume 4, Fascicle 5 ("Mathematical Preliminaries Redux; Backtracking; Dancing Links") was released in November 2019.
Volume 4B consists of material evolved from Fascicles 5 and 6.[3] The manuscript was sent to the publisher on August 1, 2022, and the volume was published in September 2022.[4] Fascicle 7 ("Constraint Satisfaction"), planned for Volume 4C, was the subject of Knuth's talk on August 3, 2022[5] and was published on February 5, 2025.[6]
- ^ "Kuth's note about his books". Archived from the original on 2025-03-01. Retrieved 2025-03-28.
- ^ "note for box 3, folder 1". Archived from the original on 2019-12-03. Retrieved 2019-12-03.
- ^ Pearson InformIT webpage book Content tab. Addison-Wesley Professional. 2022-09-28. ISBN 9780201038064. Archived from the original on 2022-07-19. Retrieved 2022-07-19.
- ^ Pearson InformIT webpage. Addison-Wesley Professional. 2022-09-28. ISBN 9780201038064. Archived from the original on 2022-07-19. Retrieved 2022-07-19.
- ^ "CP 2022 All Questions Answered, July 31–August 5, 2022, Haifa, Israel". Archived from the original on 2022-07-22. Retrieved 2022-07-22.
- ^ Pearson InformIT webpage. Addison-Wesley Professional. 2025-02-05. ISBN 9780135328248. Archived from the original on 2025-02-18. Retrieved 2025-02-18.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search