- Amazon Student members save an additional 10% on Textbooks with promo code TEXTBOOK10. Enter code TEXTBOOK10 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 e-mail address or 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 H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.
Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
Inside This Book(Learn More)
What Other Items Do Customers Buy After Viewing This Item?
Top Customer Reviews
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.
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.
If you are taking a course in Algorithms or just want to expand your knowledge, this book is for you!
I have followed a course on discrete mathematics and it is in my opinion a must to have a chance at understanding this book without being overwhelmed. The reason I am not giving it 5 stars is because there is only a subset of solved exercises in the link provided within the book. Also, the book is not taking any shortcuts to teach you about algorithms so get ready to have pen and paper at hand and even a compiler to implement the pseudo-codes on your own to truly understand them.
I recommend a quick first-pass of the book and once you're ready take a good month to study in detail the chapters of interest to your field.
Most recent customer reviews
It's a good book, but unnecessarily complicates matters that could have been approached in a better wayPublished 20 days ago by Amazon Customer
A must read for programmers IMO. Covers a wide range of fundamental algorithms and gives pretty good explanations.Published 3 months ago by Yifei Liu
just what Mt class used for lectures... what a deal compared to my campus bookstore! I'll order all my textbooks from that point onwards!Published 3 months ago by Amazon Customer
Very helpful book. Enjoy reading it together with Sedgewick's Algorihtms.Published 5 months ago by Dongxu Li
Good quality and looks very new, although some dirt on the cover but it is cleanablePublished 16 months ago by E.E
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