A university text on the design and analysis of computer algorithms.
Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, is described by its publisher as the leading algorithms text in universities and the standard reference for professionals. It has more than 70,000 citations on Google Scholar as of 2024, sold half a million copies in its first twenty years and passed a million in 2022, and is known by its authors' initials as CLRS. The authors wrote it to be comprehensive and useful in both teaching and professional work.
Each chapter focuses on one algorithm and discusses its design techniques and areas of application. The algorithms are written in pseudocode rather than a particular programming language, and the descriptions concentrate on the algorithm itself and its mathematical properties, with an emphasis on efficiency. The second edition added Stein as an author and dropped two chapters from the first, on arithmetic circuits and on algorithms for parallel computers; its green cover gave it the nickname "The Big Book".
Computer science students and professionals who need a comprehensive reference on algorithms.
Chosen by shared topics, the entries that hold them, and the people who recommended both.
Advanced work on type systems and how they capture programs' run-time behaviour.
Recommended by: Patrick Collison
Apple's programming manuals for writing Macintosh software.
Recommended by: Patrick Collison
A reference on cryptography for programmers, with code in C.
Recommended by: Patrick Collison
Tips and tools for using BSD Unix operating systems.
Recommended by: Patrick Collison
Linear algebra taught through applications in computer science.
Recommended by: Patrick Collison
How to prepare for software engineering interviews, with 150 questions and answers.
Recommended by: Patrick Collison