Theory & Algos · Book
Introduction to Algorithms (CLRS)
Cormen, Leiserson, Rivest and Stein cover the design and analysis of a broad range of algorithms in self-contained chapters, with each algorithm given in pseudocode.
Read alongside
Named in lectures
Breadth-First Search (BFS) · Erik Demaine · MIT 6.006
Standard textbook for the course, cited for graph theory appendix.
Dijkstra's Algorithm: Greedy Single-Source Shortest Paths · Srini Devadas · MIT 6.006
Cited for the half-page formal proof of Dijkstra's algorithm
Topics in Algorithms Research · Erik Demaine · MIT 6.006
Reference textbook containing Van Emde Boas trees
Concepts
Good fit if
Co-authored by MIT lecturers Charles Leiserson and Ronald Rivest—the canonical syllabus textbook for MIT 6.006 and 6.046J algorithm design and analysis.
About the book
The fourth edition adds chapters on matchings in bipartite graphs, online algorithms and machine learning. New material treats recurrence equations, hash tables, potential functions and suffix arrays, alongside 140 new exercises and 22 new problems. The book serves as the syllabus text for MIT 6.006 and 6.046J.
Authors
Readers
Where next


Connections
24Its authors, the courses that use it and the lectures that cite it.
