- Student Exclusive: Amazon Prime Student members save 10% on all textbook purchases. Enter code 10TEXT at checkout. Here's how (restrictions apply)
Introduction to Algorithms Hardcover – Jul 31 2009
Special offers and product promotions
Frequently bought together
Customers who bought this item also bought
No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
To get the free app, enter your mobile phone number.
As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen et al book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference.(Gabriel Robins, Department of Computer Science, University of Virginia)^
Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance.(Daniel Spielman, Department of Computer Science, Yale University)
About the Author
Thomas Cormen is Professor of Computer Science at Dartmouth College. Charles Leiserson is Professor of Computer Science and Engineering at MIT. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at MIT. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
What other items do customers buy after viewing this item?
Top customer reviews
The book is well written and it covers a lot of topics.
It is very rigorous indeed. It's actually empathizes rigor over accessibility.
For a beginner like me it feels like learning to speech by reading the dictionary.
I would advise you buy this book of you already know the topic a minimum but need a reference OR if you are using it as a textbook in class.
To give you an idea of the target audience, there I actually stumbled upon an instance where the book had something like this:
"By exercise XXX, some given property is true" where XXX is an exercise given at the end of a previous chapter.
Come on... Can you not, for the lone learner, explain why such property is true?
And the book also mentions that only a portion of the exercises have correction because they want the teachers to be able to give exercise and make sure the students cannot google the solution.
It does make sense. But it's another hint of the targeted audience.
I will still rate 4, because as a reference book it's good.
But beginners: you've been warned.
It's an excellent reference book. Some people think that a reference book is useless now because you can search on the internet, but I don't think you can find websites written as well as this book.
It explains algorithms directly, and doesn't beat around the bush. Cuts straight to the point. Perfect for learning and for reference.
Want to see more reviews on this item?
Most recent customer reviews
Look for similar items by category
- Books > Computers & Technology > Programming > Algorithms
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Structured Design
- Books > Textbooks > Computer Science & Information Systems > Algorithms
- Books > Textbooks > Computer Science & Information Systems > Programming Languages