Goodreads helps you keep track of books you want to read.
Start by marking “Introduction to Algorithms” as Want to Read:
Introduction to Algorithms
Enlarge cover
Rate this book
Clear rating
Open Preview

Introduction to Algorithms

(MIT Electrical Engineering and Computer Science)

4.34  ·  Rating details ·  8,588 ratings  ·  234 reviews
A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms
Hardcover, Second Edition, 1180 pages
Published September 1st 2001 by MIT Press (MA)
More Details... Edit Details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about Introduction to Algorithms, please sign up.
Popular Answered Questions
Jose Andres In my opinion an essential book, one of those that definitely deserves to be on the shelf of every programmer. Very well structured, easy to read, wit…moreIn my opinion an essential book, one of those that definitely deserves to be on the shelf of every programmer. Very well structured, easy to read, with nice pseudocode and great exercises. It give you a solid foundation in algorithms and data structures. Recommended to have a decent mathematical background, to make a better use of the book. Without doubts read this book will make you a better programmer in the long run.(less)

Community Reviews

Showing 1-30
Average rating 4.34  · 
Rating details
 ·  8,588 ratings  ·  234 reviews

More filters
Sort order
Start your review of Introduction to Algorithms
Shawn Morel
Apr 07, 2013 rated it it was ok
What a terrible book. Though it's the cornerstone of many CS undergrad algorithm courses, this book fails in every way. In almost every way, Dasgupta and Papadimitriou's "Algorithms" is a much better choice: http://www.goodreads.com/book/show/13...

It tries to be a reference book presenting a good summary of algorithms but any of the interesting bits are left as "exercises to the student." Many of these exercises are do-able but far from trivial mental connections. A few require some mental Ah Ha
Khaled Alhourani
Jun 10, 2011 rated it it was amazing  ·  review of another edition
Shelves: algorithms
An essential book for every programmer, you can't read this kind of book on bus, you need to fully constraint while reading it. The exercises after each chapter are very important to fully understand the chapter you just read, and to activate your brain's neurons. The book in itself is an outstanding one, very organized, focused and small chapters makes it easier to understand the algorithms inside it.

It contains the essential and most popular algorithms, so you can't live wthout it if you are r
Mar 22, 2011 rated it really liked it
Rather pointless to review this, as in most places this is the algorithms textbook. It's a good book that covers all the major algorithms in sufficient detail with every step clearly spelled out for the students' benefit.

Unfortunately, this neatness of presentation is also its most major drawback: (1) it spends more time describing algorithms than giving the reader an idea of how to design them, and (2) it can easily give the impression that algorithms is about spending a lot of time proving obv
Sumit Gouthaman
Dec 16, 2018 rated it it was ok
I think this book is incorrectly positioned as an "Introduction" to algorithms.

If you are interested in learning algorithms, this should probably not be the first book you read. I would instead recommend Robert Sedgewick's book or course on Coursera.

The problem with this comes down to the fact that is focuses too much on the mathematical details, while ignoring other interesting aspects. Many crucial aspects of classic algorithms are relegated to the exercises section instead of being covered fr
Nov 30, 2007 rated it it was amazing
While searching for a Bible of algorithms, I of course quickly gravitated towards Knuth's Art of Computer Programming series. It's thousands of pages long — a magnum opus still in progress; how could it not be the most desirable source?

My research quickly yielded mixed opinions from the community. Some loved Knuth's books, while others found their language impenetrable, their code irrelevant, or their assertions wrong or out of date.

All, on the other hand, universally praised Introduction to Al
Nick Black
An essential, well-written reference, and one it's quite possible to read through several times, picking up new info each time. That having been said....this book never, I felt, adequately communicated THE LOVE. The pseudocode employed throughout is absolutely wretched, at times (especially in later chapters) binding up and abstracting away subsidiary computational processes not with actual predefined functions but english descriptions of modifications thereof -- decide whether you're writing co ...more
Sep 28, 2015 rated it it was ok
Shelves: did-not-finish
Final exam: completed. This damn textbook: ignored from here on out.

Whenever I look at it now, all I can think of is Alex in Clockwork Orange: "Eggiwegs! I want to SMASH THEM!"

This book did not help me in my class, not one tiny bit. Like so many other math-oriented textbooks, there is literally not one damn thing in the book that is not teachable but the teaching moments are all lost in math gymnastics, over-explaining, under-explaining, etc. Please, just once, let someone with the teaching tal
Josh Davis
I've been reading CLRS on and off for years. I read bits at a time and have been picking and choosing chapters to read and reread. I must say that without a doubt this is the best textbook I have ever read. I could not recommend it anymore for anyone that wishes to learn about data structures and algorithms well. The authors never skimp on the math and that's my favorite part of this book. Almost every idea that is presented is proven with a thorough proof. All of the pseudocode is completely go ...more
Koen Crolla
Some people just really enjoy typing, I guess. Not so much communicating, though: I was already pretty familiar with almost all of the algorithms and data structures discussed (the bit on computational geometry was the only thing that was completely new), but I can honestly say that if Introduction to Algorithms had been my first textbook, I wouldn't be.

(Also, I wish editors would stop writers when they try to use 1-indexed arrays in their books. Or, for that matter, pseudocode in general. Machi
Jan 10, 2014 rated it really liked it
Shelves: computer-science
Well, technically I didn't finish reading all the chapters in the book, but at least I've read most of it. The topics in the book is well explained with concise example. But sometimes, I need to find out the explanation by myself, things that I found interesting but sometimes frustrating. If I run into this situation, sometimes I need to find another reference to help me understand the problem. But still, this is a good book. ...more
Blog on Books
Jul 26, 2010 rated it really liked it
Algorithms, which perform some sequence of mathematical operations, form the core of computer programming. Intended as a text for computer programming courses, especially undergraduate courses in data structures and graduate courses in algorithms, an “Introduction to Algorithms” provides a comprehensive overview, that will be appreciated technical professionals, as well.

The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Computer programmer
Ana Todor
May 04, 2012 rated it it was amazing
Ow you great book you, you served me well.
Jens Jacob
Good, but not the best
Apr 29, 2018 rated it liked it
It has ben 14 years since I touched a math-oriented theoretical work like this, and that hurt a lot while slogging through this textbook. After graduating a lot of the software engineering skills you pick up are geared towards practicality. I literally forgot some mathematical terms I had to look up again. Sadly, trying to understand it's lemma's with the help of the appendices is not doable as they are even heavier than the things they try to explain.
Besides that problematic point, it's an exc
Dmitry Kuzmenko
Nov 19, 2010 rated it it was amazing  ·  review of another edition
The book gives a solid foundation of common non-trivial algorithms and data structures. It all comes with nice pseudocode, detailed walk-throughs and complexity analysis (along with worst case, average case and amortized complexity).

Personally I'd prefer to see the material in much more compact form, covering more of topics and more advanced or tricky algorithms and data structures. However, when something isn't clear, the detailed walk-throughs really help. Also, the exercises provided are inva
Mohammad Samiul Islam
Apr 18, 2015 rated it it was amazing
This books is amazing.

It's a bit hard for beginners, but then again, it's one of those books which you always have to come back to. Each time you come back, you learn something new. The exercises themselves have tons of stuff hidden in them. You need to be patient and learn slowly. Don't try to gobble everything up.

If you let go of your fear, and actually make an effort to learn something from it, you can learn loads. I learned Network Flow algorithm by reading this book. It took me few days, b
Ashraf Bashir
Aug 06, 2021 rated it really liked it
Shelves: technical
This book is miscalled an “introduction” to algorithms. It is not an introduction at all, it's a Bible on the topic! It requires an above-average mathematical background as well. It is very well explained in-depth, with more than enough explanation. A must-read for any professional software developer. Highly recommended! ...more
Feb 08, 2010 rated it really liked it
The textbook on algorithms. It does not do a very good job of teaching how to design algorithms, but it is an authoritative catalog of algorithms for a wide variety of situations.
May 03, 2012 rated it it was amazing
This is an excellent book for software engineers and students of computer science and engineering who want to have a good understanding of algorithms.
Ahmad Hosseini
Mar 10, 2021 rated it really liked it
the hard way to learning algorithms
Dec 14, 2021 rated it really liked it
Some days, it's the only sane source. Some days, it's too damn complex to make sense of. ...more
Aayush Shrivastava
Aug 15, 2022 rated it really liked it
Very vast coverage of the whole syallabus.
Great depth to the algorithm and more on thier proof.
Things that I really don't like times I feel I am not feeling algorithms book rather a mathematics book only. It should contain more colorful diagram somewhat less mathematics and more more problems related to computer science implementation of algorithms.
Because of the most of mathematical rigor sometimes you loose your enthusiasm to read algorithms.
But overall a good read.
Mar 27, 2020 rated it really liked it
Used this while cramming for coding interviews.
Oct 30, 2017 rated it did not like it
This is one of the worst college books I have ever used. The examples in the book are severely lacking the needed information to answer the questions in which you are forced to use outside resources aka other Data Structure books to find the info to solve their problems. It is amazing that this is an MIT book because it DOES NOT MEET THEIR STANDARD. The book is unorganized and bounces around like the authors have ADHD. The text is covering an extremely abstract computer algorithm theories and fa ...more
Harshil Lodhi
Jan 10, 2016 rated it really liked it
Shelves: computer-science
A book that one should definitely read once in the computer science career. It gives a mathematical and in depth look at how to understand algorithms and data structures, their time and space complexities and its proofs.

It could be a little hard, complex and lengthy for those who don't like in depth mathematics or those who just want to understand the DS and Algo at application level.

It is a classic and available for free so one should definitely read it.
Endilie Yacop Sucipto
Dec 26, 2017 rated it it was amazing
CLRS is without doubt one of the best book when learning about Algorithms, sometimes called as the "bible" of algorithm. However, while it is more of a reference book with very lengthy pages, it lacks some in-depth explanation on certain parts. I guess that's fine because it is indeed an "introductory" book. ...more
Casper Weiss Bang
Jan 30, 2021 rated it it was ok
Contains a lot of great references but it is horrible as an introduction piece. This is given to CS students and used to learn about algorithms. This is bloody horrible. It presents the algorithms in a language that makes a lot of sense for seasoned mathematicians but for entry level developer i personally didn't like it. It's great as a reference sheet, but for much more i don't recommend it. ...more
Feb 11, 2009 rated it really liked it
If you've got to learn algorithms, this is the book to get. ...more
Alex Ott
Great book on algorithms and their analysis. Must read for any programmer, who wants to understand programming from ground up
Kaung Htet Zaw
Apr 20, 2013 rated it it was amazing
One of the best algorithm textbooks out there. Always my go-to book for algorithm reference.
« previous 1 3 4 5 6 7 8 next »
topics  posts  views  last activity   
quickbooks error the file exists - full description 1 1 Jul 23, 2021 01:34AM  
about the book 6 87 May 01, 2015 06:29PM  

Readers also enjoyed

  • The C Programming Language
  • Design Patterns: Elements of Reusable Object-Oriented Software
  • Cracking the Coding Interview: 150 Programming Questions and Solutions
  • Code Complete
  • Effective Java
  • Introduction to the Theory of Computation
  • Structure and Interpretation of Computer Programs
  • Head First Design Patterns
  • Designing Data-Intensive Applications
  • Algorithms
  • Clean Code: A Handbook of Agile Software Craftsmanship
  • Artificial Intelligence: A Modern Approach
  • Deep Learning
  • The Algorithm Design Manual
  • The Pragmatic Programmer: From Journeyman to Master
  • The C++ Programming Language
  • Refactoring: Improving the Design of Existing Code
  • Grokking Algorithms An Illustrated Guide For Programmers and Other Curious People
See similar books…

Goodreads is hiring!

If you like books and love to build cool products, we may be looking for you.
Learn more »
Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. He is a Full Professor of computer science at Dartmouth College and currently Chair of the Dartmouth College Writing Program.

Other books in the series

MIT Electrical Engineering and Computer Science (7 books)
  • Robot Vision
  • Abstraction and Specification in Program Development
  • Structure and Interpretation of Computer Programs
  • Computation Structures
  • Instructor's Manual to Accompany Structure and Interpretation of Computer Programs
  • Structure and Interpretation of Computer Programs: JavaScript Edition

News & Interviews

As the final days of the year tick themselves off the calendar, the 2022 Goodreads Reading Challenge is coming to a close. Sincere...
75 likes · 38 comments