Goodreads helps you keep track of books you want to read.

Start by marking “Introduction to Algorithms” as Want to Read:

# Introduction to Algorithms

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)

## 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

This book is not yet featured on Listopia.
Add this book to your favorite list »

## Community Reviews

(showing 1-30)

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

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

It contains the essential and most popular algorithms, so you can't live wthout it if you are r ...more

*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

*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

The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Computer programmer ...more

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

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

Apr 18, 2015
Mohammad Samiul Islam
rated it
it was amazing
·
review of another edition

Shelves:
computer-science,
favorites

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

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

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.

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.

Jun 17, 2017
Fatima
rated it
it was amazing
·
review of another edition

Shelves:
computer-science,
textbooks

The classical reference on Algorithms. What more can I say?

Aug 25, 2015
Jascha
rated it
it was amazing
·
review of another edition

Shelves:
software-enginnering-algorithms

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

I still use this book occasionally.

The major topics presented are sorting, data structures, graph algorithms and a variety of selected topics. Computer programmer ...more

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

an interesting feature, with respect to the exercises and especially problems for each chapter, is that i think corme ...more

I gave it 4 stars instead of 5 because I ...more

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

*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

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.

topics | posts | views | last activity | |
---|---|---|---|---|

about the book | 6 | 72 | May 01, 2015 06:29PM |

## Goodreads is hiring!

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

No trivia or quizzes yet. Add some now »