Sign inSign in

Theory & Algos · Book

Introduction to Algorithms (CLRS)

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

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.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford SteinCourse text for 6.006MIT Press20221,312 pagesnamed in 13 lectures

Watch the course it teaches · 6.006Find a copy

Opens a bookshop outside Lectern.

Read alongside

Named in lectures

2:16

Breadth-First Search (BFS) · Erik Demaine · MIT 6.006

Standard textbook for the course, cited for graph theory appendix.

39:09

Dijkstra's Algorithm: Greedy Single-Source Shortest Paths · Srini Devadas · MIT 6.006

Cited for the half-page formal proof of Dijkstra's algorithm

39:47

Topics in Algorithms Research · Erik Demaine · MIT 6.006

Reference textbook containing Van Emde Boas trees

10 more moments

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

No reader has written about it yet.

Write the first review

Where next

24 connections