The Art of Computer Programming (TAOCP)
|
| |
Click hereto sign up forThe Art of Computer Programming Newsletter,which features updates on new editions and promotions.
At the end of 1999, these books were named among the best twelvephysical-science monographs of the century byAmerican Scientist, along with: Dirac on quantum mechanics, Einstein on relativity, Mandelbrot on fractals, Pauling on the chemical bond, Russell and Whitehead on foundations of mathematics, von Neumann and Morgenstern on game theory, Wiener on cybernetics, Woodward and Hoffmann on orbital symmetry, Feynman on quantum electrodynamics, Smith on the search for structure, and Einstein's collected papers.Wow!
View “historic” publisher'sbrochure from the first edition of Volume 1 (1968)
A complimentarydownloadable PDF containing the collected indexes isavailablefrom the publisher to registered owners of the five-volume boxed set.This PDF includes the complete indexes of Volumes 1, 2, 3, 4A, and 4B, as well asthe index to Volume 1 Fascicle 1.Registered owners of the earlier four-volume boxed set are, similarly,entitled to download anearlier collection of indexes. This earliercollection includes Volumes 1, 2, 3, and 4A; Volume 1; and Volume 4 Fascicles 5 and 6.
These volumes are now available also in portable electronic form,using PDF format.Special care has been taken to make the search featurework well. Thousands of useful "clickable"cross-references are also provided — from exercises to theiranswers and back, from the index to the text, from the text toimportant tables and figures, etc.
Warning:Unfortunately, however, non-PDF versions have also appeared,against my recommendations, and those versions are frankly quite awful.A great deal of expertise and care is necessary to do the job right.If you have been misled into purchasing one of these inferiorversions (for example, a Kindle edition), the publishers havetold me that they will replace your copy with the PDF editionthat I have personally approved.Do not purchase eTAOCPin Kindle format if you expect the mathematics to make sense.(The ePUB format may be just as bad; I really don't want to know,and I am really sorry that it was released.)Please do not tell me about errors that you find in a non-PDFeBook; such mistakes should be reported directly to the publisher.Some non-PDF versions also masquerade as PDF.
The authorized PDF versions can be purchased atwww.informit.com/taocp.If you have purchased a different version of the eBook, and can provide proofof purchase of that eBook, you can obtain a gratis PDF verson bysending email and proof of purchase totaocp@pearson.com.
Fundamental Algorithms, Third Edition(Reading, Massachusetts: Addison-Wesley, 1997), xx+650pp.ISBN 0-201-89683-4
Volume 1 Fascicle 1,MMIX: A RISC Computer for theNew Millennium (2005), v+134pp. ISBN 0-201-85392-2
Translations of previous editions:
Romanian translation by Adrian Davidoviciu, Adrian Petrescu, Smaranda Dimitriu, and Paul Zamfirescu,Tratat de programarea calculatoarelor, V. 1:Algoritmi fundamentali (Bucharest: Editura tehnica, 1974), 676pp.
Russian translation by Galina P. Babenko and Iu. M. Baiakovskii, edited by K. I. Babenko, and V. S. Shtarkman,Iskusstvo programmirovaniia dlia ÉVM, T. 1:Osnovnye algoritmy (Moscow: Mir, 1976), 735pp.
Japanese translation, under direction of Takakazu Simauti, in two volumes:
Chinese translation by Guan JiWen and Su Yunlin,Ji Suan Ji Cheng Xu She Ji Ji Qiao, 1. Juan:Ji Ben Suan Fa (Beijing: Defense Industry Publishing Co., 1980), 14+573pp.
Spanish translation by Michel Antscherl Harlange and Joan Lluis i Biset, under direction of Ramón Puigjaner i Trepat,El Arte de Programar Ordenadores, V. 1:Algoritmos Fundamentales (Barcelona: Reverté, 1980), xxiii+672pp.
Hungarian translation, under direction of Miklós Simonovits,A számítógép-programozás művészete, V. 1:Alapvető algoritmusok (Budapest: Műszaki Könyvkiadó, 1987), 654pp.
Translations of the third edition:
Russian translation by S. G. Trigub, Yu. G. Gordienko, and I. V. Krasikov, edited by S. N. Trigub and directed by Yu. V. Kozachenko,Iskusstvo programmirovaniia, T. 1:Osnovnye algoritmy (Moscow:Vil'iams, 2000), 713pp
Chinese translation by Su Yunlin,Ji Suan Ji Cheng Xu She Ji Yi Shu, 1. Juan:Ji Ben Suan Fa (Beijing: National Defense Industry Press, 2002), xx+625pp.
Chinese translationby Li Bomin, Fan Ming, and Jiang Aijun,Ji Suan Ji Cheng Xu She Ji Yi Shu, 1. Juan:Ji Ben Suan Fa (Beijing: Posts & Telecom Press, 2016), xv+517pp.
Polish translation by G. Jakacki,Sztuka Programowania, T. 1:Algorytmy Podstawowe (Warsaw:Wydawnictwa Naukowo-Techniczne, 2002), xxiv+679pp.
Romanian translation by Mihaela Târpa,Arta programării calculatoarelor, V. 1:Algoritmi fundamentali (Bucharest: Editura Teora Bucuresti, 2002), 616pp.
Japanese translation by Takashi Aoki, Kazuhiko Kakehi, Kenichi Suzuki, and Takahiro Nagao, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:ASCII Corporation, 2004), xxii+632pp.Republished (softcover) byASCII DWANGO in 2015.
Korean translation by Ryu Gwang,컴퓨터프로그래밍의예술 1:기초알고리즘 (Seoul: Hanbit Media, 2006), 793pp.
Czech translation by David Krásenský,Umění programování, 1. díl:Základní algoritmy (Brno:Computer Press, 2008), xx+649pp.
Macedonian translation by Aristotel Tentov,Umetnosta na kompjuterskoto programiranje, T. 1,Fundamentalni algoritmi (Skopje:Prosvetno Delo, 2009), 724pp.
Albanian translation by Visar Zejnulahu,Arti i programimit kompjuterik, V. 1,Algoritma fundamentalë (Skopje:Prosvetno Delo, 2009), xx+680pp.
Greek translation by Manos Roumeliotis and Stavros Souraklas (Athens:Tziolas Publications, 2010), 751pp.
Translations of fascicles:
Romanian translation of Volume 1 Fascicle 1, by Ioan Bledea:MMIX: Un calculator RISC pentru noul mileniu (Bucharest: Editura Teora, 2005), ix+149pp.
Japanese translation of Volume 1 Fascicle 1, by Takashi Aoki, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:ASCII Corporation, 2006), vii+134pp.
Republished (softcover) byASCII DWANGO in 2015.
Chinese translation of Volume 1, Fascicle 1, by Su Yunlin (Beijing: China Machine Press, 2006), 268pp.
Chinese translation of Volume 1, Fascicle 1, by Jiang Zhiqiang and Huang Zhibin(Beijing: Posts & Telecom Press, 2020), viii+308pp.
Russian translation of Volume 1 Fascicle 1, by Yu. G. Gordienko, edited by S. N. Trigub,MMIX --- RISC-komp'iuter dlia novogo tysiacheletiia (Moscow:Vil'iams, 2007), 151pp.
Polish translation of Volume 1 Fascicle 1, by G. Jakacki:MMIX --- komputer na nowe tysiąclecie (Warsaw:Wydawnictwa Naukowo-Techniczne, 2008), xii+146pp.
Hungarian translation of Volume 1 Fascicle 1, under the direction of Antal Iványi:MMIX. RISC számítógép a következő évezredre (Budapest:AnTonCom Infokommunikációs Kft., 2009), 168pp.
Seminumerical Algorithms, Third Edition(Reading, Massachusetts: Addison-Wesley, 1997), xiv+762pp.
ISBN 0-201-89684-2
Translations of previous editions:
Russian translation by Galina P. Babenko, É. G. Belaga, and L. V. Maiorov, edited by K. I. Babenko,Iskusstvo programmirovaniia dlia ÉVM, T. 2:Poluchislennye algoritmy (Moscow: Mir, 1977), 724pp.
Japanese translation, under direction of Takakazu Simauti, in two volumes:
Romanian translation by Florian Petrescu, Ioan Georgescu, Rolanda Predescu, and Paul Zamfirescu,Tratat de programarea calculatoarelor, V. 2:Algoritmi seminumerici (Bucharest: Editura tehnica, 1983), 722pp.
Chinese translation by Guan JiWen and Su Yunlin,Ji Suan Ji Cheng Xu She Ji Ji Qiao, 2. Juan:Ban Shu Zhi Suan Fa (Beijing: Defense Industry Publishing Co., 1992), 10+622pp.
Hungarian translation, under direction of Miklós Simonovits,A számítógép-programozás művészete, V. 2:Szeminumerikus algoritmusok (Budapest: Műszaki Könyvkiadó, 1987), 690pp.
Translations of the third edition:
Russian translation by L. F. Kozachenko, V. T. Tertyshnyi, and I. V. Krasikov, edited by S. N. Trigub and directed by Yu. V. Kozachenko,Iskusstvo programmirovaniia, T. 2:Poluchislennye algoritmy (Moscow:Vil'iams, 2000), 830pp.
German translation of Chapter 4 by Rüdiger LoosArithmetik (Heidelberg: Springer Verlag, 2001), xiii+538pp.
Chinese translation by Su Yunlin,Ji Suan Ji Cheng Xu She Ji Yi Shu, 2. Juan:Ban Shu Zhi Suan Fa (Beijing: National Defense Industry Press, 2002), xii+760pp.
Chinese translationby Wu Bin and Fan Ming,Ji Suan Ji Cheng Xu She Ji Yi Shu, 2. Juan:Ban Shu Zhi Suan Fa (Beijing: Posts & Telecom Press, 2016), x+603pp.
Romanian translation by Mihaela Târpa, Cora Radulian, and Mihai Iosif,Arta programării calculatoarelor, V. 2:Algoritmi seminumerici (Bucharest: Editura Teora Bucuresti, 2002), 663pp.
Polish translation by Adam Malinowski,Sztuka Programowania, T. 2:Algorytmy Seminumeryczne (Warsaw:Wydawnictwa Naukowo-Techniczne, 2002), xviii+820pp.
Japanese translation by Hiroaki Saito, Takahiro Nagao, Shogo Matsui, Takao Matsui, and Hitoshi Yamauchi, supervised by Makoto Arisawa and Eiiti Wada (Tokyo: ASCII Corporation, 2004), xvi+725pp.Republished (softcover) byASCII DWANGO in 2015.
Korean translation by Ryu Gwang,컴퓨터프로그래밍의예술 2:준수치적알고리즘 (Seoul: Hanbit Media, 2007), 933pp.
Greek translation by Manos Roumeliotis and Stavros Souraklas (Athens:Tziolas Publications, 2010), 911pp.
Czech translation by David Krásenský,Umění programování, 2. díl:Seminumerické algoritmy (Brno:Computer Press, 2010), xii+763pp.
Sorting and Searching, Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), xiv+780pp.+foldout.
ISBN 0-201-89685-0
Translations of the first edition:
Romanian translation by Rodica Boconcios, A. Davidoviciu, P. Dimo, Fl. Moraru, A. Petrescu, I. Sipos, and Smaranda Dimitriu,Tratat de programarea calculatoarelor, V. 3:Sortare şi căutare (Bucharest: Editura tehnica, 1976), xii+736pp.
Russian translation by Nadezhda I. V'iukova, V. A. Galatenko, and A. B. Khodulev, edited by Iu. M. Baiakovskii and V. S. Shtarkman,Iskusstvo programmirovaniia dlia ÉVM, T. 3:Sortirovka i poisk (Moscow: Mir, 1978), 844pp.
Chinese translation by Guan JiWen and Su Yunlin,Ji Suan Ji Cheng Xu She Ji Ji Qiao, 3. Juan:Pai Xu He Cha Zhao (Beijing: Defense Industry Publishing Co., 1985), viii+645pp.
Spanish translation by Jaime de Argila y de Chopitea and Ramón Puigjaner Trepat, under direction of Ramón Puigjaner Trepat,El Arte de Programar Ordenadores, V. 3:Clasificación y Búsqueda (Barcelona: Reverté, 1980), xxiii+672pp.
Hungarian translation, under direction of Miklós Simonovits,A számítógép-programozás művészete, V. 3:Keresés és rendezés (Budapest: Műszaki Könyvkiadó, 1988), 761pp.
Translations of the second edition:
Russian translation by V. T. Tertyshnyi and I. V. Krasikov, edited by S. N. Trigub and directed by Yu. V. Kozachenko,Iskusstvo programmirovaniia, T. 3:Sortirovka i poisk (Moscow:Vil'iams, 2000), 823pp.
Chinese translation by Su Yunlin,Ji Suan Ji Cheng Xu She Ji Yi Shu, 3. Juan:Pai Xu Yu Cha Zhao (Beijing: National Defense Industry Press, 2002), x+779pp.
Chinese translationby Jia Hongfeng,Ji Suan Ji Cheng Xu She Ji Yi Shu, 3. Juan:Pai Xu Yu Cha Zhao (Beijing: Posts & Telecom Press, 2017), x+632pp.
Polish translation by K. Diks and A. Malinowski,Sztuka Programowania, T. 3:Sortowanie i Wyszukiwanie (Warsaw:Wydawnictwa Naukowo-Techniczne, 2002), xviii+838pp.
Romanian translation by Mihaela Târpa,Arta programării calculatoarelor, V. 3:Sortare şi căutare (Bucharest: Editura Teora Bucuresti, 2002), 680pp.
Japanese translation by Yuichiro Ishii, Hiroshi Ichiji, Hiroshi Koide, Eiko Takaoka, Kumiko Tanaka, and Takahiro Nagao, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:ASCII Corporation, 2006), xvi+741pp.
Republished (softcover) byASCII DWANGO in 2015.
Korean translation by Ryu Gwang,컴퓨터프로그래밍의예술 3:정렬과검색 (Seoul: Hanbit Media, 2007), 941pp.
Greek translation by Manos Roumeliotis and Stavros Souraklas (Athens:Tziolas Publications, 2010), 926pp.
Combinatorial Algorithms, Part 1(Upper Saddle River, New Jersey: Addison-Wesley, 2011), xvi+883pp.
ISBN 0-201-03804-8
(Preliminary drafts were previously published as paperback fascicles;see below.)
Russian translation (Moscow:Dialektika, 2019), 955pp.
Japanese translation by Kazuhiko Kakehi and Hiroshi Koide, and Eiiti Wada, supervised by Eiiti Wada (Tokyo:ASCII DWANGO, 2017), xvi+866pp.
Chinese translationby Li Bomin and Jia Hongfeng (Beijing: Posts & Telecom Press, 2019), xii+731pp.
Korean translation by Ryu Gwang,컴퓨터프로그래밍의예술 4A: 조합적알고리즘1부 (Seoul: Hanbit Media, 2013), xxiv+1160pp.
Combinatorial Algorithms, Part 2(Upper Saddle River, New Jersey: Addison-Wesley, 2023), xviii+714pp.
ISBN 0-201-03806-4
(Preliminary drafts were previously published as paperback fascicles;see below.)
Japanese translation by Hideya Iwasaki, Naoyuki Tamura, Minoru Terada, and Eiiti Wada, supervised by Eiiti Wada (Tokyo:ASCII DWANGO, 2023, xx+708pp.
Chinese translationby Xiongxin Yang, Guang Hu, Xihan Li, and Fei Liu (Beijing: Posts & Telecom Press, 2025), xviii+590pp.
Korean translation by Ryu Gwang (Seoul: Hanbit Media, 2024), in preparation.
Present plans are for Volumes 4A and 4B to be the first in a series of severalsubvolumes 4A, 4B, 4C, ... entitledCombinatorial Algorithms,Part 1, 2, 3, .... The remaining subvolumes, currently in preparation,will have the following general outline:
New material for Volume 4will first appear in beta-test form as fascicles of approximately128 pages each, issued approximately twice per year.These fascicles will represent my best attempt to write a comprehensiveaccount; but computer science has grown to the point where I cannot hopeto be an authority on all the material covered in these books. ThereforeI'll need feedback from readers in order to prepare the official volumes later.
For example, the following fascicles appeared before the hardcover editions ofVolumes 4A and 4B were complete.
Volume 4 Fascicle 0, Introduction to Combinatorial Algorithmsand Boolean Functions (2008), xii+216pp. ISBN 0-321-53496-4
Volume 4 Fascicle 1, Bitwise Tricks & Techniques; BinaryDecision Diagrams (2009), xiii+261pp. ISBN 0-321-58050-8
Volume 4 Fascicle 2, Generating All Tuples and Permutations(2005), v+128pp. ISBN 0-201-85393-0
Volume 4 Fascicle 3, Generating All Combinations and Partitions(2005), vi+150pp. ISBN 0-201-85394-9
Volume 4 Fascicle 4, Generating All Trees; History ofCombinatorial Generation (2006), vi+120pp. ISBN 0-321-33570-8
Volume 4 Fascicle 5, Mathematical Preliminaries Redux; Introduction to Backtracking; Dancing Links (2019), xiii+384pp. ISBN 978-0-13-467179-6
Volume 4 Fascicle 6, Satisfiability (2015), xiii+310pp. ISBN 978-0-13-439760-3
Translations of those fascicles:
Japanese translation of Volume 4 Fascicle 0 by Eiiti Wada (Tokyo:ASCII Media Works, 2009), xii+206pp.
Chinese translation of Volume 4 Fascicle 0, under the direction of Lin Peng Huang (Beijing: Chinese Machine Press, 2010), xii+432pp.
Hungarian translation of Volume 4 Fascicle 0, under the direction of Antal Iványi:Bevezetés a kombinatorikai algoritmusokhoz és a Boole-függvényekhez (Budapest:AnTonCom Infokommunikációs Kft., 2009), in preparation.
Albanian translation of Volume 4 Fascicle 0 by Ana Ktona, Besmira Nushi, and Silvana Greca,Arti i programimit kompjuterik, V. 4, Fashikulli 0,Hyrje ne algoritmat me Kombinatoralë dhe funksionet Boolean (Bitola: Mikena, 2009), 238pp.
Hungarian translation of Volume 4 Fascicle 1, under the direction of Antal Iványi:Bitenkénti trükkök és módszerek; Bináris döntési diagramok (Budapest:AnTonCom Infokommunikációs Kft., 2009), in preparation.
Japanese translation of Volume 4 Fascicle 1 by Eiiti Wada (Tokyo:ASCII Media Works, 2011), x+256pp.
Romanian translation of Volume 4 Fascicle 2, by Cora Radulian:Generarea tuturor tuplurilor și permutărilor (Bucharest: Editura Teora, 2005), vii+144pp.
Japanese translation of Volume 4 Fascicle 2 by Hiroshi Koide, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:ASCII Corporation, 2006), viii+129pp.
Russian translation of Volume 4 Fascicle 2, by Yu. G. Gordienko:Generatsiia vsekh kortezheĭ i perestanovok (Moscow:Vil'iams, 2007), 146pp.
Polish translation of Volume 4 Fascicle 2, by Adam Malinowski:Generowanie wszystkich krotek i permutacji (Warsaw:Wydawnictwa Naukowo-Techniczne, 2007), xiv+137pp.
Hungarian translation of Volume 4 Fascicle 2, under the direction of Antal Iványi:Permutációk ésn-esek előállítása (Budapest:AnTonCom Infokommunikációs Kft., 2008), 160pp.
Russian translation of Volume 4 Fascicle 3, by I. V. Krasikov:Generatsiia vsekh sochetaniĭ i razbieniĭ (Moscow:Vil'iams, 2007), 200pp.
Japanese translation of Volume 4 Fascicle 3 by Kazuhiko Kakehi, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:ASCII Corporation, 2008), viii+154pp.
Hungarian translation of Volume 4 Fascicle 3, under the direction of Antal Iványi:Kombinációk és partíciók előállítása (Budapest:AnTonCom Infokommunikációs Kft., 2008), 176pp.
Russian translation of Volume 4 Fascicle 4, by I. V. Krasikov:Generatsiia vsekh derev'ev. Istoriia kombinatornĭ generatsiĭ (Moscow:Vil'iams, 2007), 156pp.
Hungarian translation of Volume 4 Fascicle 4, under the direction of Antal Iványi:Fák előállítása; Kombinatorikus előállítások története (Budapest:AnTonCom Infokommunikációs Kft., 2008), 160pp.
Japanese translation of Volume 4 Fascicle 4 by Kazuhiko Kakehi and Hiroshi Koide, supervised by Makoto Arisawa and Eiiti Wada (Tokyo:ASCII Corporation, 2010), viii+118pp.
The future Volume 4C is currently represented by
Volume 4 Fascicle 7, Constraint Satisfaction (2025), xiv+281pp. ISBN 978-0-13-532824-8
Some "pre-fascicles" are also available for alpha-testing:Pre-Fascicle 8a (Hamiltonian Paths and Cycles);Pre-Fascicle 9b (A Potpourri of Puzzles).I've put them online primarily so that experts in the field can check thecontents before I inflict them on a wider audience. But if you want tohelp debug them, please go right ahead.
Syntactic Algorithms,in preparation.
Estimated to be ready in 2030.
As I continue to write Volumes 4 and 5, I'll need to refer to topics thatbelong logically in Volumes 1--3 but weren't invented yet when I wrote thosebooks. Instead of putting such material artificially into Volumes 4 or 5,I'll put it into fascicle form. The first such fascicle is in factready now (see above): It describesMMIX,a RISC machine that is used in Volume 4A;MMIX will alsotake the place ofMIX in all subsequent editionsof Volumes 1, 2, and 3.
Download the 16 Feb 2004 version of Volume 1 Fascicle 1 (583KB of compressed PostScript) (this old version is however no longer being maintained; see the errata below)
After Volume 5 has been completed, I will revise Volumes 1--3 again tobring them up to date. In particular, the new material for those volumesthat has been issued in beta-test fascicles will be incorporated at that time.
Then I will publish a “reader's digest” editionof Volumes 1--5, condensing the most important material into a single book.
And after Volumes 1--5 are done, God willing, I plan to publishVolume 6 (the theory of context-free languages) and Volume 7 (Compilertechniques), but only if the things I want to say about those topicsare still relevantand still haven't been said. Volumes 1--5 represent the central coreof computer programming for sequential machines; the subjects of Volumes6 and 7 are important but more specialized.
Volumes 1--4B are available from the publisher,Addison-Wesley Publishing Company.
TheMIX computer will soon be replaced by a RISC machine calledMMIX. Meanwhile if you wantto try out the existing programs for the original 60s-era machine,you might be able to find suitable software at the following sites:
(Please let me know of any other sites that I should add to this list.)
Martin Ruckert has written an excellent 200-page companion to Volumes 1, 2,and 3, intelligentlytranslating all of theMIX programs intoMMIX form.This booklet is jam-packed with instructive details and opportunities forself-instruction.
The main changes between the second and third editions of Volume 1are listed in theErrata for Volume 1 (2nd ed.)(335K bytes of compressed PostScript, 80pp)---an archival filethat is not being kept up to date. But thousands ofadditional refinements appear in the 3rd edition; you really shouldask someone to get it for you next Christmas.
The main changes to the third edition of Volume 1, made beforethe appearance of Volume 4A in 2011, are listed in theEarliest errata for Volume 1 (3rd ed.)(262K bytes of compressed PostScript, 50pp).
There's also another major list of changes, covering the period 2011--2021:Earlier changes for Volume 1 (3rd ed.)(143K bytes of compressed PostScript, 20pp).
There's also a (much shorter, last updated 09 September 2025) list of changessince the 49th printing was released in 2022, almost all of which have beenmade in more recent printings:
Note: You can't run that TeX file through TeX; it imports all kinds ofother files that are private. But if you have no way to look at compressedPostScript files, you might try reading the TeX code as a last resort;at least you'll be able to figure out the page numbers on whichcorrections have been made.
And there's also a list of changes to Volume 1 Fascicle 1,last updated 08 January 2025:
Note: An unknown number of badly printed copies of Volume 1 Fascicle 1were printed by mistake. Among other defects, the copyright pagehas incredibly poor resolution, and theMMIX summary charthas been omitted from the inside back cover.If you have purchased one ofthese monstrosities, the publishers assure me that they will replaceyour copy with a good one.
The main changes between the second and third editions of Volume 2are listed in theErrata for Volume 2 (2nd ed.)(555K bytes of compressed PostScript, 142pp)---an archival file that isnot being kept up to date. But thousands ofadditional refinements appear in the 3rd edition; you really shouldask someone to get it for you next Christmas.
The main changes to the third edition of Volume 2, made beforethe appearance of Volume 4A, are listed in theEarliest errata for Volume 2 (3rd ed.)(229K bytes of compressed PostScript, 50pp), dated 08 January 2011.
There's also another major list of changes, covering the period 2011--2021:Earlier changes for Volume 2 (3rd ed.)(133K bytes of compressed PostScript, 19pp).
There's also a (much shorter, last updated 18 July 2025) list of changes since the 45th printing was released in 2022, almost all of which have been made in more recent printings:
Note: You can't run that TeX file through TeX; it imports all kinds ofother files that are private. But if you have no way to look at compressedPostScript files, you might try reading the TeX code as a last resort;at least you'll be able to figure out the page numbers on whichcorrections have been made.
The main changes between the first and second editions of Volume 3are listed in theErrata for Volume 3 (1st ed.)(430K bytes of compressed PostScript, 109pp)---an archival file that isnot being kept up to date. But thousands ofadditional refinements appear in the 2nd edition; you really shouldask someone to get it for you next Christmas.
The main changes to the second edition of Volume 3, made beforethe appearance of Volume 4A in 2011, are listed in theEarliest errata for Volume 3 (2nd ed.)(226K bytes of compressed PostScript, 43pp).
There's also another major list of changes, covering the period 2011--2021:Earlier changes for Volume 3 (2rd ed.)(117K bytes of compressed PostScript, 15pp).
There's also a (much shorter, last updated 12 August 2025) list of changes since the 45th printing was released in 2022, almost all of which have been made in more recent printings:
Note: You can't run that TeX file through TeX; it imports all kinds ofother files that are private. But if you have no way to look at compressedPostScript files, you might try reading the TeX code as a last resort;at least you'll be able to figure out the page numbers on whichcorrections have been made.
The following corrections to the paperback fascicles that preceded Volume 4Awill make them essentially consistent with the first hardcover printingof that volume. (These errata files reached their final form on01 January 2011, and they won't be updated again; see below foradditional amendments and corrections to the hardcover printing.)
The main changes to the first edition of Volume 4A, made beforethe appearance of Volume 4B in 2022, are listed in theEarliest errata for Volume 4A(225K bytes of compressed PostScript, 44pp).
There's also a (much shorter, last updated 09 September 2025) list of changes since the 20th printing was released in 2022, almost all of which have been made in more recent printings:
Note: You can't run that TeX file through TeX; it imports all kinds ofother files that are private. But if you have no way to look at compressedPostScript files, you might try reading the TeX code as a last resort;at least you'll be able to figure out the page numbers on whichcorrections have been made.
The following corrections to the paperback fascicles that preceded Volume 4Bwill make them essentially consistent with the first hardcover printingof that volume. (These errata files reached their final form on26 July 2022, and they won't be updated again; see below foradditional amendments and corrections to the hardcover printing.)
And there's also a list of changes to Volume 4 Fascicle 6:
Here's the current list of changes to the hardcover edition of Volume 4B,last updated 16 September 2025:
Note: You can't run that TeX file through TeX; it imports all kinds ofother files that are private. But if you have no way to look at compressedPostScript files, you might try reading the TeX code as a last resort;at least you'll be able to figure out the page numbers on whichcorrections have been made.
Volume 4C is just getting started, as stated above. So far at least its firstcouple hundred pages are available as Volume 4 Fascicle 7.Here are the corrections that I've made so far to my master copy ofthat fascicle (last updated 15 September 2025):
Note: You can't run that TeX file through TeX; it imports all kinds ofother files that are private. But if you have no way to look at compressedPostScript files, you might try reading the TeX code as a last resort;at least you'll be able to figure out the page numbers on whichcorrections have been made.
The first finder of any error in my books receives0x$1.00 ($2.56),deposited to their account at theBank of San Serriffe;significant suggestions are also worth0x$0.20 ($0.32) each.If you are a really careful reader, you maybe able to recoup more than the cost of the books this way,and you'll be helping future readers too.
However, people who have read the bookEats, Shoots & Leavesshouldnot expect a reward for criticizing the ways in whichI use commas. Punctuation is extremely important to me, but I insist ondoing it my own way.
Similarly, you can save yourself valuable time bynot tryingto get me to change ‘awhile’ to ‘a while’.
As mentioned above, I take no responsibility for errors in the eBookeditions that do not use PDF format. I would soon go broke if I had topay for all of them! Such errors should be reported directly to thepublisher, not to me, and you should request a replacement copy.
Please send your comments either by email totaocp@cs.stanford.eduor by old-fashioned mail to
Donald E. Knuth
Computer Science Department
CoDa Building room W208
389 Jane Stanford Way
Stanford University
Stanford, CA 94305-5008 USA.
In either case please include your postal address, so that I canmail an official certificate of deposit as a token of thanks for anyimprovements to which you have contributed.
SPECIAL NOTE TO THE SPEAKERS OF FRENCH AND OTHER EXOTIC LANGUAGES:Numerous quotations and bibliographic citations found in these books have beencopied verbatim from the original sources. If you believe you havefound a typographic error, you must prove it by showing that theoriginal was incorrectly transcribed; believe it or not, your languagehas changed over the years, just as English has.
Although I'm working full time on Volume 4C these days, I will try to replyto all such messages within nine months of receipt.
BUT PLEASE DO NOT SEND EMAIL TO TAOCP EXCEPT TO REPORT ERRORS IN THE ART OF COMPUTER PROGRAMMING.And if you do report an error via email, pleasedo notinclude attachments of any kind; your message should bereadable on brand-X operating systems for all values of X.(Encrypted messages that I get from "gmail.com" are alsogibberish and unreadable without great pain.)Send PLAIN ASCII TEXT ONLY.
Don Knuth's home pageDon Knuth's other books