- Series: MIT Press
- Hardcover: 1312 pages
- Publisher: The MIT Press; 3rd edition (July 31, 2009)
- Language: English
- ISBN-10: 0262033844
- ISBN-13: 978-0262033848
- Product Dimensions: 8 x 1.8 x 9 inches
- Shipping Weight: 4.7 pounds (View shipping rates and policies)
- Average Customer Review: 462 customer reviews
- Amazon Best Sellers Rank: #13,563 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Introduction to Algorithms, 3rd Edition (MIT Press) 3rd Edition
Use the Amazon App to scan ISBNs and compare prices.
The Amazon Book Review
Author interviews, book reviews, editors picks, and more. Read it now
Frequently bought together
Customers who bought this item also bought
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.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
The up sides: there's a lot of information and explanations are usually extensive and clear. Clear figures illustrate the concept explained in the book and come examples and exercises are presented.
The down sides: explanations are sometimes too lengthy. Also, all the code is written in pseudocode, which is nice but sometimes i felt a C or Java version of the code would have made it more clear to understand.
All in all i would definitely recommend it if you are moving the first steps into algorithm design.
The book arrived in very good condition, but the printer have to pay attention when they cut the sheets, my book arrived with about 30 pages that doesn't fit quite well because of how they cut those sheets, but with scissors and being careful you can solve it easily. That's the reason I rate it with 4 stars, otherwise it is 5 stars. Check the other reviews on the content to decide whether to buy it or not, but I really recommend it.
Check out Cormen's website to get some of the more subtle puns. Some are borderline groaners, but still add to the fun of learning algorithms.
I used it for school but also for reviewing my concepts before a technical interview.
I like that this book covers from basic concepts to the advanced ones in the areas of data structures and algorithms. It is also great for complexity analysis.