rcmnd

Introduction to AlgorithmsBook

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

Who uses, recommends or left Introduction to Algorithms, in their own words: each a verbatim quote with a link to where it was said.

3 people

Rakhim Davletkaliyev
Programmer and educator. Keeps a public bookshelf with a short comment on every book.
loved

Spent endless hours digging through The Book. It’s very well written and organized and was a tremendous help in my CS studies.

Marked “Great book!” on his public bookshelf.

2026-08-16·rakhim.org ↗

Fabien Sanglard
Programmer and author of the Game Engine Black Book series; writes about game engine internals and retro hardware at fabiensanglard.net.
recommended

Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein.

Post recommending five algorithms and data structures books that suit different kinds of readers.

2014-02-13·fabiensanglard.net ↗

Dan Luu
Programmer and writer on computer architecture, performance and software reliability; has worked on hardware and software at Centaur Technology, Google and Microsoft, and writes at danluu.com.
mixedaffiliate link

but this is wildly impractical as a standalone introduction for most people.

'Programming book recommendations and anti-recommendations' — a topic-by-topic list of the technical books he has read, with what each one is and is not good for. The site gives no day, only 10/16 in its index.

2016-10-01·danluu.com ↗

What they also use

Every entry is a verbatim quote and a link to the public post it came from. Nothing is paraphrased. If it is not on record somewhere public, it is not here.

The verdict is what they actually said: loved and liked are explicit; recommended means they told others to get it; uses means they only say they use it; read is a book on their public shelf with no verdict; mixed and disliked are kept too.

A dashed affiliate link, sponsored or their own label means the post disclosed a relationship. It is shown, never hidden.

The shading behind a date shows how dated a recommendation is for its kind of thing.

The shading behind a date shows how dated a recommendation is, for its kind of thing. Fully green is recent. It drains a quarter at a time as the post gets older, and is empty once it reads as dated.

What counts as old depends on the thing. A laptop praised four years ago has been replaced twice; a book loved twenty years ago is probably still loved. The shading is gone after about:

Stripes mean the post carries no date and the date shown is an estimate. No date at all, no shading.