Book · 1990
Introduction to Algorithms
by Thomas H. Cormen
The textbook four MIT professors wrote to settle every algorithms argument, cited by 254 Reddit commenters across 12 subreddits and still going.
What does Reddit think of Introduction to Algorithms?
CLRS — Cormen, Leiserson, Rivest, and Stein, as r/compsci shorthand has it — sits at the center of Reddit's algorithms canon without quite sitting at the top. r/compsci (70 mentions) positions it alongside Concrete Mathematics as required theory — heavier on proof than on practice. r/cscareerquestions (51 mentions, flat sentiment) is where the friction surfaces. One commenter with ↑105 upvotes at r/programming identified a viral tweet's bullet points as "literally just section headings from CLRS" — that's the book's reputation in one line. r/ExperiencedDevs contributes 13 mentions, all neutral; working practitioners cite it as assumed background, not active reading. The book isn't losing ground conceptually. It's just stopped being a discovery. Nobody replaces it. The question is whether you're the kind of reader who actually will open it.
Community feedback & reader fit
Themes
- · Algorithm analysis and correctness proofs
- · Data structures foundations
- · Interview and competitive programming preparation
- · Academic CS curriculum staple
- · Theory-versus-practice tension
Common praise
- + r/compsci (↑96) pairs it with Concrete Mathematics as the two books that make upper-division CS theory click.
- + The proofs teach you to think about correctness rather than trust the code — a different skill from LeetCode pattern recognition.
- + Every section heading in every interview prep guide traces back to CLRS, so you already know the table of contents before you open it.
- + The ↑268 r/learnprogramming commenter writing a CS Master's thesis still lists it as the anchor of a serious algorithms study stack.
Common criticism
- − r/cscareerquestions threads treat it as a reference to cite rather than a book to read cover to cover; 51 mentions and flat sentiment.
- − Mention volume has dropped from 63 in 2019 to 14 in 2025, suggesting newer resources are absorbing beginner traffic.
- − Practical implementations are left as exercises, which frustrates readers who want runnable code alongside the pseudocode.
Who it's for
You're in a CS program, or interviewing at a company that cares what O(n log n) actually means and why. If Skiena's Algorithm Design Manual felt too breezy on the proofs, this is the step up.
Mentions over time
Which Reddit comments matter for Introduction to Algorithms?
Top-upvoted quotes across the subreddits where this book is mentioned. Click through to read the full thread.
“Here's the list, for anyone interested in just that: 1. The Pragmatic Programmer by David Thomas & Andrew Hunt (67% recommended) 2. Clean Code by Robert C. Martin (66% recommended) 3. Code Complete by Steve McConnell (42% recommended) 4. Refactoring by Martin Fowler (35% recommended) 5. Hea…
“For algorithms to *click*, at least for me, a basic understanding of programming, math and general theory in the subject was required +++ a ton of practical practice. I am currently writing my CS Master's thesis and would personally recommend, based on my own studies and experience, a combination of…
“Here's my list of the classics: **General Computing** * But How Do It Know? - The Basic Principles of Computers for Everyone * The Elements of Computing Systems: Building a Modern Computer from First Principles * […
“I'm 27 years old software developer. I believe in taking care of myself and a balanced diet and rigorous leetcode routine. In the morning if my laptop is a little slow I'll put on an ice pack to cool it while doing my leetcode practice. I've done 1000 now. After I remove the ice pack I take a deep d…
“These are literally just section headings from CLRS.
“As someone who recently switched jobs in a similar way to OP, here was my schedule. I did this consistently from Jan 2021 2nd week to May 2021 1st/2nd week. The motivation for me was that my company was not doing great overall, and I wanted to jump ship before all the work ended up on my head. Keep …
“I feel theoretical books are far more important than pop/hard non fiction. - **Concrete Mathematics**: A Foundation for Computer Science by Knuth et al. - **Introduction to Algorithms**, by Cormen et el ( or **The Algorithm Design Manual** by Steven Skiena — I'm particularly fond of this book than …
“Cormen, Leiserson, Rivest, and Stein. Introduction to Algorithms.
Convinced? Pick up Introduction to Algorithms
Readers also mention
Books that share discussion threads with Introduction to Algorithms — counted from the comments, not curated.
The Art of Computer Programming
Donald E. Knuth
Donald Knuth's multi-volume monument to algorithms: the book programmers cite in library lists and almost nobody finishes.
Structure and Interpretation of Computer Programs
Harold Abelson
MIT's 1985 Scheme textbook that 319 Reddit commenters have recommended and a noticeably smaller number have finished.
Grokking Algorithms
Aditya Y. Bhargava
A Python-illustrated tour of data structures and algorithms that r/learnprogramming treats as the first step before Leetcode, not a replacement for it.
Cracking the Coding Interview
Gayle Laakmann McDowell
The book that turned software hiring into a sport — written by the ex-Googler who introduced programming challenges to the process in the first place.
Effective Java
Joshua Bloch
Joshua Bloch's item-by-item case for writing Java the way the platform was designed to be used, with 90 independent recommendations that aged better than most of the language.
Modern Operating Systems
Andrew S. Tanenbaum
Tanenbaum's textbook walks through every layer of an OS — scheduling, memory, file systems, threads — one chapter at a time, with the implementation details left in.
Introduction to Algorithms — frequently asked
Is Introduction to Algorithms still worth reading in 2026?+
The material holds. r/compsci (70 mentions) still names it alongside Knuth's Concrete Mathematics as a foundational CS text. Its presence in recommendation threads has quieted; it's cited as assumed background now, not a fresh discovery.
What does Reddit think of Introduction to Algorithms compared to The Algorithm Design Manual?+
The r/compsci thread with ↑96 upvotes names both and admits preferring Skiena for intuition and problem-solving heuristics, while still listing CLRS first for rigor. Nobody argues one replaces the other. CLRS for understanding why an algorithm is correct; Skiena for recognizing which algorithm to reach for.
Is Introduction to Algorithms too hard for self-taught developers?+
Probably, without preparation. The ↑268 r/learnprogramming comment is explicit: algorithms click only after a working foundation in programming, math, and theory, plus a lot of practice. CLRS assumes mathematical maturity that most self-taught paths skip.
Should I read Introduction to Algorithms before doing LeetCode?+
Depends on your tolerance for formalism. r/cscareerquestions (51 mentions) pairs it with LeetCode but treats it as a supplement, not a prerequisite. One ↑102 comment describes a structured 4-month job-switch prep plan where CLRS is the theory layer and LeetCode is the reps. Reading CLRS cold before any practice problems is a common way to stall out.