Editing The Art of Computer Programming (section)

===Previous editions===
====Complete volumes====
These volumes were superseded by newer editions and are in order by date.
* ''Volume 1: Fundamental Algorithms''. First edition, 1968, xxi+634pp, {{ISBN|0-201-03801-3}}.<ref name="WellsReview">{{cite journal |author-last=Wells |author-first=Mark B. |title=Review: ''The Art of Computer Programming, Volume 1. Fundamental Algorithms'' and ''Volume 2. Seminumerical Algorithms'' by Donald E. Knuth |journal=Bulletin of the American Mathematical Society |date=1973 |volume=79 |issue=3 |pages=501–509 |url=https://www.ams.org/journals/bull/1973-79-03/S0002-9904-1973-13173-8/S0002-9904-1973-13173-8.pdf |doi=10.1090/s0002-9904-1973-13173-8 |doi-access=free |access-date=2018-06-20  |archive-date=2016-10-20  |archive-url=https://web.archive.org/web/20161020162321/http://www.ams.org/journals/bull/1973-79-03/S0002-9904-1973-13173-8/S0002-9904-1973-13173-8.pdf |url-status=live }}</ref>
* ''Volume 2: Seminumerical Algorithms''. First edition, 1969, xi+624pp, {{ISBN|0-201-03802-1}}.<ref name="WellsReview"/>
* ''Volume 3: Sorting and Searching''. First edition, 1973, xi+723pp+foldout, {{ISBN|0-201-03803-X}}. Errata: [https://cs.stanford.edu/~knuth/err3-1e.ps.gz].
* ''Volume 1: Fundamental Algorithms''. Second edition, 1973, xxi+634pp, {{ISBN|0-201-03809-9}}. Errata: [https://cs.stanford.edu/~knuth/err1-2e.ps.gz].
* ''Volume 2: Seminumerical Algorithms''. Second edition, 1981, xiii+ 688pp, {{ISBN|0-201-03822-6}}. Errata: [https://cs.stanford.edu/~knuth/err2-2e.ps.gz].
* ''The Art of Computer Programming, Volumes 1-3 Boxed Set''. Second Edition (Reading, Massachusetts: Addison-Wesley, 1998), pp. {{ISBN|978-0-201-48541-7|0-201-48541-9}}
* ''The Art of Computer Programming, Volumes 1-4A Boxed Set''. Third Edition (Reading, Massachusetts: Addison-Wesley, 2011), 3168pp. {{ISBN|978-0-321-75104-1|0-321-75104-3}}

====Fascicles====
Volume 4, [[fascicle (book)|Fascicles]] 0–4 were revised and published as Volume&nbsp;4A.
* ''Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions''. (Addison-Wesley Professional, 2008-04-28) vi+240pp, {{ISBN|0-321-53496-4}}. Errata: [https://cs.stanford.edu/~knuth/all4f0.ps.gz] (2011-01-01).
* ''Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams''. (Addison-Wesley Professional, 2009-03-27) viii+260pp, {{ISBN|0-321-58050-8}}. Errata: [https://cs.stanford.edu/~knuth/all4f1.ps.gz] (2011-01-01).
* ''Volume 4, Fascicle 2: Generating All Tuples and Permutations''. (Addison-Wesley, 2005-02-14) v+127pp, {{ISBN|0-201-85393-0}}. Errata: [https://cs.stanford.edu/~knuth/all4f2.ps.gz] (2011-01-01).
* ''Volume 4, Fascicle 3: Generating All Combinations and Partitions''. (Addison-Wesley, 2005-07-26) vi+150pp, {{ISBN|0-201-85394-9}}. Errata: [https://cs.stanford.edu/~knuth/all4f3.ps.gz] (2011-01-01).
* ''Volume 4, Fascicle 4: Generating All Trees; History of Combinatorial Generation''. (Addison-Wesley, 2006-02-06) vi+120pp, {{ISBN|0-321-33570-8}}. Errata: [https://cs.stanford.edu/~knuth/all4f4.ps.gz] (2011-01-01).
Volume 4, Fascicles 5–6 were revised and published as Volume&nbsp;4B.
* ''Volume 4, Fascicle 5: Mathematical Preliminaries Redux; Backtracking; Dancing Links''. (Addison-Wesley, 2019-11-22) xiii+382pp, {{ISBN|978-0-13-467179-6}}. Errata: [https://cs.stanford.edu/~knuth/all4f5.ps.gz] (2020-03-27)
* ''Volume 4, Fascicle 6: Satisfiability''. (Addison-Wesley, 2015-12-08) xiii+310pp, {{ISBN|978-0-13-439760-3}}. Errata: [https://cs.stanford.edu/~knuth/all4f6.ps.gz] (2020-03-26)

====Pre-fascicles====
Volume 1
* Pre-fascicle [https://cs.stanford.edu/~knuth/fasc1.ps.gz 1] was revised and published as Volume 1, fascicle 1.
Volume 4
* [[Pre-fascicle]]s [https://cs.stanford.edu/~knuth/fasc0a.ps.gz 0A], [https://cs.stanford.edu/~knuth/fasc0b.ps.gz 0B], and [https://cs.stanford.edu/~knuth/fasc0c.ps.gz 0C] were revised and published as Volume 4, fascicle 0.
* Pre-fascicles [https://cs.stanford.edu/~knuth/fasc1a.ps.gz 1A] and [https://cs.stanford.edu/~knuth/fasc1b.ps.gz 1B] were revised and published as Volume 4, fascicle 1.
* Pre-fascicles [https://cs.stanford.edu/~knuth/fasc2a.ps.gz 2A] and [https://cs.stanford.edu/~knuth/fasc2b.ps.gz 2B] were revised and published as Volume 4, fascicle 2.
* Pre-fascicles [https://cs.stanford.edu/~knuth/fasc3a.ps.gz 3A] and [https://cs.stanford.edu/~knuth/fasc3b.ps.gz 3B] were revised and published as Volume 4, fascicle 3.
* Pre-fascicles [https://cs.stanford.edu/~knuth/fasc4a.ps.gz 4A] and [https://cs.stanford.edu/~knuth/fasc4b.ps.gz 4B] were revised and published as Volume 4, fascicle 4.
* Pre-fascicles [https://cs.stanford.edu/~knuth/fasc5a.ps.gz 5A], [https://cs.stanford.edu/~knuth/fasc5b.ps.gz 5B], and [https://cs.stanford.edu/~knuth/fasc5c.ps.gz 5C] were revised and published as Volume 4, fascicle 5.
* Pre-fascicle [https://cs.stanford.edu/~knuth/fasc6a.ps.gz 6A] was revised and published as Volume 4, fascicle 6.
* Pre-fascicle [https://cs.stanford.edu/~knuth/fasc7a.ps.gz 7A] was revised and published as Volume 4, fascicle 7.

The remaining pre-fascicles contain draft material that is set to appear in future fascicles and volumes.

* ''[https://cs.stanford.edu/~knuth/fasc8a.ps.gz Volume 4, Pre-fascicle 8A: Hamiltonian Paths and Cycles]''
* ''[https://cs.stanford.edu/~knuth/fasc8b.ps.gz Volume 4, Pre-fascicle 8B: Cliques]''
* ''[https://cs.stanford.edu/~knuth/fasc9b.ps.gz Volume 4, Pre-fascicle 9B: A Potpourri of Puzzles]''
* ''[https://cs.stanford.edu/~knuth/fasc9c.ps.gz Volume 4, Pre-fascicle 9C: Estimating Backtrack Costs]''
* ''[https://cs.stanford.edu/~knuth/fasc12a.ps.gz Volume 4, Pre-fascicle 12A: Components and Traversal] [https://cs.stanford.edu/~knuth/fasc12a+.pdf (PDF Version) ]''
* ''[https://cs.stanford.edu/~knuth/fasc14a.ps.gz Volume 4, Pre-fascicle 14A: Bipartite Matching]''
* ''[https://cs.stanford.edu/~knuth/fasc16a.ps.gz Volume 4, Pre-fascicle 16A: Introduction to Recursion]''