
A multi-volume monograph on programming algorithms and their analysis.
Donald Knuth's multi-volume monograph presents programming algorithms and their analysis. He began it in 1962 as a single book of twelve chapters; the plan grew to seven volumes, of which Volumes 1 to 5 are meant to cover the central core of programming for sequential machines. Volume 1, Fundamental Algorithms (basic concepts and information structures), appeared in 1968, Volume 2, Seminumerical Algorithms (random numbers and arithmetic), in 1969, and Volume 3, Sorting and Searching, in 1973.
Work on Volume 4, Combinatorial Algorithms, stopped in 1977 while Knuth built a typesetting system after the second edition of Volume 2; Volume 4A appeared in 2011 and 4B in 2022, with further parts planned. Knuth took a quantitative approach after his analysis of linear probing, and his examples use MIX, a teaching machine he designed. Volume 1 was written while he worked at Caltech and consulted for Burroughs, whose B220 and B5500 computers tested most of its programs. The work has been called the profession's defining treatise.
Programmers and computer scientists who want the most thorough treatment of algorithms in print.
Chosen by shared topics, the entries that hold them, and the people who recommended both.
MIT's introductory computer science text, taught through Lisp and Scheme.
Recommended by: Bret Victor, Patrick Collison, Paul Graham and 1 other
Advanced work on type systems and how they capture programs' run-time behaviour.
Recommended by: Patrick Collison
A reference on cryptography for programmers, with code in C.
Recommended by: Patrick Collison
Linear algebra taught through applications in computer science.
Recommended by: Patrick Collison
A university text on the design and analysis of computer algorithms.
Recommended by: Patrick Collison
A tour of deep ideas in mathematics, computer science and physics.
Recommended by: Patrick Collison, Emmett Shear