Skip to content
Cover of Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

Introduction to Algorithms

Fourth Edition

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

5/5
MIT Press 1312 pages April 5, 2022

The comprehensive introduction to algorithms used by universities worldwide. Known as CLRS, this textbook covers a broad range of algorithms in depth with rigorous yet accessible explanations, pseudocode, and mathematical proofs.

This page contains affiliate links. As an Amazon Associate, Bookworm Jim earns from qualifying purchases, at no extra cost to you.

Share:

Jim's Review

🐛
This is THE algorithm bible, folks. This chunky tome is on every CS student's desk (and doubles as a doorstop in a few dorms). It's dense, it's thorough, and it will make your brain hurt in the best possible way. If you're serious about computer science, CLRS is non-negotiable. Five worms — it earned every one.

Jim is our fictional cartoon mascot. His reviews and ratings are editorial opinions written with AI assistance. How the reviews are made

Featured In

Jim's Weekly Worm Hole

Get book picks like this delivered to your inbox every week. No spam, just groovy reads.

You Might Also Like

View: