Algorithms Illuminated (Part 1): The Basics
by Tim Roughgarden
The clearest on-ramp to algorithms I've read — short, honest, and it actually sticks.
- Status
- Read · January 2022
- Bought
- January 27, 2022
- For
- Self-taught engineers filling in CS gaps · Anyone prepping for algorithm interviews · People who bounced off CLRS
The one-paragraph verdict
Roughgarden does the rare thing: he writes like he’s explaining at a whiteboard, not defending a proof to a committee. The pseudocode is clean, the “why does this work” sections actually answer the question, and the companion YouTube lectures mean you get the same material twice in two formats. The appendices on induction and discrete probability are a genuinely useful refresher you’ll re-read. The honest caveat: Part 1 is narrow by design — it’s the basics and nothing more — and several of the practice problems ship without answers, which stings when you’re studying alone. If you want one book that covers everything, this isn’t it; it’s a deliberately small first step.
Who should read it
Read it if you’re self-taught, prepping for interviews, or you opened CLRS, felt nothing but dread, and closed it again. It assumes comfort with basic math but holds your hand through the rest. Skip it if you already have a solid undergrad algorithms course behind you — you’ll find Part 1 too gentle to be worth the time.
Where it earned its place
This is the book that finally made big-O feel like intuition instead of a memorized table. It also reset my expectations for technical writing: clarity is a choice, and most authors simply don’t make it. I keep it on the shelf as a reminder of what good explanation looks like.
Skip it if…
You want exhaustive coverage in one volume, or you learn best from terse reference material rather than narrative. This is a teaching book, and it’s slow on purpose — that’s a feature for some readers and a tax for others.
[Algorithms Illuminated (Part 1) on Goodreads]