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

4.3  ·  Rating Details ·  5,775 Ratings  ·  134 Reviews
There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. "Introduction to Algorithms" combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference. "Introduction to Algorithms" covers both classical material and such modern d ...more
Hardcover
Published June 18th 1990 by MIT Press (MA) (first published December 1st 1989)
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,…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)
This book is not yet featured on Listopia. Add this book to your favorite list »

Community Reviews

(showing 1-30)
filter  |  sort: default (?)  |  Rating Details
Shawn Morel
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
...more
Khaled Alhourani
Jun 10, 2011 Khaled Alhourani 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
...more
Alex
Nov 30, 2007 Alex rated it it was amazing  ·  review of another edition
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
...more
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
Saharvetes
Mar 22, 2011 Saharvetes rated it really liked it  ·  review of another edition
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
...more
Arif
Jan 10, 2014 Arif rated it really liked it  ·  review of another edition
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.
Blog on Books
Jul 26, 2010 Blog on Books rated it really liked it  ·  review of another edition
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
...more
Brad
Feb 08, 2010 Brad rated it really liked it  ·  review of another edition
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.
Sheikh
May 03, 2012 Sheikh rated it it was amazing  ·  review of another edition
This is an excellent book for software engineers and students of computer science and engineering who want to have a good understanding of algorithms.
Israel Dee Beloved
Good book
Joke
Das Buch wurde uns zur Vertiefung zur Vorlesung "Algorithmen und Datenstrukturen" empfohlen. Da es kein Skript im klassischen Sinn gab (dafür eine Mailingliste und eingescannte Notizen des Dozenten), war das Buch somit meine Hauptinformationsquelle für die Nachbereitung nach der Vorlesung. Dabei hat sich das Buch als extrem hilfreich erwiesen, obwohl natürlich nur ein Bruchteil des Buches überhaupt behandelt wurde, da das den Rahmen des 1. Semesters mit Sicherheit gesprengt hätte. Dazu kommt noc ...more
Dmitry Kuzmenko
Nov 19, 2010 Dmitry Kuzmenko 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
...more
Libertas
Oct 16, 2016 Libertas rated it really liked it  ·  review of another edition
Just a word of advice, this is NOT an introductory work.

It is commonly used in graduate level CS courses and the text focuses more heavily on the math side than the CS side.

That's not meant to demean the quality of this book. I highly recommend undergrad CS students / folks preparing for interviews read this at farther along point in your education and instead start with the Algorithm Design Manual, which is more focused on the practical and immediate design concerns than mathematical correctn
...more
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
Mohammad Samiul Islam
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
...more
Harshil Lodhi
Jan 10, 2016 Harshil Lodhi rated it really liked it  ·  review of another edition
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.
Kaung
Apr 20, 2013 Kaung rated it it was amazing  ·  review of another edition
One of the best algorithm textbooks out there. Always my go-to book for algorithm reference.
Fatima
Jun 17, 2017 Fatima rated it it was amazing  ·  review of another edition
The classical reference on Algorithms. What more can I say?
Dmitry
Feb 26, 2017 Dmitry rated it it was amazing  ·  review of another edition
Very useful book.
Jascha
I remember I first read this book back at the beginning of 2000, since it was among the suggested titles for the Data Structures and Algorithms course at the University. Algorithms are one of those topics whose core did not significantly change in the last 30 years, despite the many publications that, every month, introduce new concepts and better solutions. This means that any book from the 80's is valuable, as long as the concepts it presents are concise and well explained. The importance of t ...more
Gert-Jan
Used this during a computer science course in the last year of my astrophysics study. It was (of course...) a bitch to read, learn and grasp everything in this book, but I did pass the exam without problems. Only later on did I realise how great this book actually was. An example of clarity IMHO.

I still use this book occasionally.
Tim
Jul 20, 2010 Tim rated it liked it  ·  review of another edition
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
...more
Erik
Sep 28, 2015 Erik rated it it was ok  ·  review of another edition
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
...more
Jeffrey Milloy
May 25, 2007 Jeffrey Milloy rated it really liked it  ·  review of another edition
Shelves: computers, textbooks
apparently the second most cited computer science book, and for good reason. (no, i don't know the top most cited, and no, its not knuth). but, what a vast and exciting array of pseudocode, algorithms, and their data structures! good largley for being rich and dense, but readable. doesn't waste space over explaining, but should be sufficient for most anyone with a active interest.

an interesting feature, with respect to the exercises and especially problems for each chapter, is that i think corme
...more
Rex
May 25, 2012 Rex rated it liked it  ·  review of another edition
This book, like several of the other college textbooks I have bought, has several really good chapters....but also many, many pages which I consider "bloat." I personally would greatly prefer an extraction of the key topics without hundreds of pages of "had to keep releasing new editions of this textbook every year so we had to add more chapters on increasingly wide ranging and arcane topics." Anyways, the core chapters are very nice - it also contains a lot of "review" e.g. discussion on mathem ...more
Stefan
Sep 18, 2016 Stefan rated it really liked it  ·  review of another edition
The title should almost be "introduction to algorithms that you have already been studying for years because you are a CS PhD candidate and/or a professor who tortures undergrads". A great study on algorithms, it's definitely not for the faint of heart, especially if you are like m and bought this for autodidactic purposes. I love the classic pseudo-code style, but I can see how people who did not grow up with direct Algol-variants can find it off-putting.

I gave it 4 stars instead of 5 because I
...more
Shivam Shukla
Oct 16, 2015 Shivam Shukla rated it really liked it  ·  review of another edition
This is an excellent book with introduction to algorithms. I would recommend reading this with the MIT OCW lectures by the same prof. who has written it. It becomes way more cooler to follow it along with the lectures. I have given 4 stars instead of 5 just because I find it to be lacking in the coding part. The algorithms have been analysed on the basis of pseudo-code with the implementation part being left. I do not think that it is a good way to explain. Any algorithms must be followed by at ...more
Emil Petersen
Jul 22, 2015 Emil Petersen rated it it was amazing  ·  review of another edition
Shelves: computer-science
This will probably be the longest and most comprehensive book of all the books that I am ever going to read. And it is incredible! Every page is so rich in information that it is simply not possible to read more than a few an hour and still maintaining comprehension. This is the first time I have read it - and I will most likely have to consult its pages many times over in the following years. Hopefully, with each iteration, I'll grasp some of the things which I definitely did not understand ful ...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
...more
Greg
Dec 17, 2015 Greg rated it it was amazing  ·  review of another edition
Quite frankly, it's the standard for a reason. Sure, this book or that book, might be better at explaining one concept or another, but this explains every concept you need reasonably well... EVERY concept.

Google recommends it by name for their hiring practices, and I've kept it hand for years, and still refer to it 8 years after my 3rd computer degree.

If you don't find it useful, you're not doing computer science, you're a code monkey.
« previous 1 3 4 5 6 7 8 9 next »
topics  posts  views  last activity   
about the book 6 72 May 01, 2015 06:29PM  
  • Compilers: Principles, Techniques, and Tools
  • Artificial Intelligence: A Modern Approach
  • Introduction to the Theory of Computation
  • Structure and Interpretation of Computer Programs (MIT Electrical Engineering and Computer Science)
  • The Art of Computer Programming, Volumes 1-3 Boxed Set
  • The Algorithm Design Manual
  • Modern Operating Systems
  • Programming Pearls
  • Introduction to Automata Theory, Languages, and Computation
  • Algorithms
  • Advanced Programming in the UNIX Environment
  • Concrete Mathematics: A Foundation for Computer Science
  • Hacker's Delight
  • The C Programming Language
  • Effective C++: 55 Specific Ways to Improve Your Programs and Designs
  • Purely Functional Data Structures
  • Applied Cryptography: Protocols, Algorithms, and Source Code in C
  • Operating System Concepts

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.

More about Thomas H. Cormen...

Share This Book