- 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: 580 customer reviews
- Amazon Best Sellers Rank: #8,313 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.
"Enlightenment Now: The Case for Reason, Science, Humanism, and Progress"
Is the world really falling apart? Is the ideal of progress obsolete? Cognitive scientist and public intellectual Steven Pinker urges us to step back from the gory headlines and prophecies of doom, and instead, follow the data: In seventy-five jaw-dropping graphs, Pinker shows that life, health, prosperity, safety, peace, knowledge, and happiness are on the rise. Learn more
Frequently bought together
Customers who bought this item also bought
Customers who viewed this item also viewed
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).
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
I recall struggling with the subject matter, despite having worked with computers since childhood and completing the requisite high-school mathematics courses. The approach taken by the authors is fairly direct; there is little hand-holding, although there are 100 pages of appendices covering pre-requisites.
I had my moments of wanting to hurl it across the room, but it remained amongst the few texts I held onto, thinking it might be useful or enlightening in the future, relative to the burden of lugging it around. I've since upgraded from the 2nd edition to the 3rd, and occasionally pick it up, read a few sections or a chapter and complete some exercises.
Each topic in the book is covered in the same way:
- Explanation of problem or concept.
- Example(s) and/or diagram(s)
- Mathematical proofs, where applicable.
- Problem set
Tip: Concrete Mathematics by Knuth is good primer, establishing the specific discrete and continuous mathematical techniques underpinning the algorithms, and filling several knowledge gaps. Also, Cormen has published a more approachable version of this text ("Algorithms Unlocked") which which be more appropriate to some.
None of the solutions to the exercises are provided in the book, but a few are available at the books website: mitpress.mit.edu/books/introduction-algorithms.
That said, the "Kindle version" is everything a Kindle version should not be. First, even on my phone or on my Mac, page size and count don't adapt to my screen size and zoom, so it is just like a big PDF... except for the second (and most important) point: IT IS NOT EVEN COMPATIBLE WITH ACTUAL KINDLE. That means, your Kindle won't even let you download it... so actually this is even worse than a PDF document.
Without these problems, the price would be more than fair... but the way it is now, I feel like I was robbed.
My only complaint is that the binding has completely stated disintegrating after only 9 weeks of use. All of chapters 15 and 16 are completely falling out of my copy (and this is getting worse). Very disappointing as I plan on using it for a long time.
There are tons of other algorithm textbooks out there but don't let the other ones fool you; this is the omnibus and the leader. I've read others (Skiena, Algorithms in a Nutshell) and although they are for different audiences, I'd still recommend CLRS in every case.
Don't be fooled by the Intro in the title. It is pretty math heavy and works a lot with proofs. Most of them are explained well but sometimes they need to be read a few times because they are just more difficult material.
Either way, get this book if you want to learn algorithms. I'd eat a rock if you read it and it didn't help you significantly in understanding algorithms.
For those who have been in the field for a while, owning this book also has nostalgia value. It's like owning a NES Classic. You know you'll only play that thing once in a while. But having it just brings back good memories. So, enjoy having this hard covered edition on your shelf. It'll bring a smile to your face.