Chapter-by-chapter recaps of Cormen, Leiserson, Rivest & Stein — the concept, the pseudocode, the diagram, and the one thing worth remembering.
This is a recap track for people who already read CLRS once, in college or since, and want the ideas back without rereading 1300 pages. Every chapter gets its own page: what problem the chapter solves, the pseudocode in the book’s own notation, diagrams where a picture does the work, the running-time results with a sketch of why they hold, and a short recap block at the end.
Numbering follows the 4th edition (2022). If you read the 3rd edition, most chapters map across directly, but Part IV onward is renumbered: dynamic programming moved from 15 to 14, graphs from 22–26 to 20–24, and the Fibonacci-heap and van Emde Boas chapters left the printed book. Pages flag the differences where they matter.
Extra depth on the data structures. Part III (chapters 10–13) and Part V (17–19) are the chapters most worth having at your fingertips day to day, so those pages go deeper: more diagrams, more invariants spelled out, and the operation-by-operation cost tables in full.