- Paperback: 1312 pages
- Publisher: PHI Learning Pvt. Ltd. (Originally MIT Press); Third edition (February 2, 2010)
- Language: English
- ISBN-10: 8120340078
- ISBN-13: 978-8120340077
- Product Dimensions: 8.5 x 1.3 x 11 inches
- Shipping Weight: 15.2 ounces
- Average Customer Review: 452 customer reviews
- Amazon Best Sellers Rank: #54,017 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 (Eastern Economy Edition) Third Edition
Use the Amazon App to scan ISBNs and compare prices.
This month's Book With Buzz: "The Lying Game" by Ruth Ware
From the instant New York Times bestselling author of blockbuster thrillers "In a Dark, Dark Wood" and "The Woman in Cabin 10" comes Ruth Ware’s chilling new novel, "The Lying Game." See more
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, Deptt. 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, Deptt. of Computer Science, Yale University
"In light of the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. This beautifully written, thoughtfully organized book is the definitive introductory book on the design and analysis of algorithms. The first half offers an effective method to teach and study algorithms; the second half then engages more advanced readers and curious students with compelling material on both the possibilities and the challenges in this fascinating field."
—Shang-Hua Teng, University of Southern California
About the Author
Thomas H. Cormen received bachelor’s degree in Electrical Engineering from the Princeton University way back in 1978. Thereafter, he did his master’s in Electrical Engineering and Computer Science from the MIT. Among the students, he is best known for having co-authored a book titled 'Introduction to Algorithms'. In the year 2013, he published another book titled 'Algorithms Unlocked'. This book too has been received well.
Charles E. 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.
Browse award-winning titles. See more
Top customer reviews
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.
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.
Students will need a very strong mathematical background and a strong arm to even think about picking up this book because the it is heavy (both physically and metaphorically). Mastery of discrete math is a must, graph theory, programming, and, combinatorics will also help.
With that said, this book falls short in one MAJOR area, explanations. Too often explanations are left out and left as exercises and there are no solutions to the exercises! Or details are replaced by ambiguous statements such as of "cleary, this works", or "it is easy to see that this ...". I get the concept of learning by doing, really I do, but there should be some kind of solutions so the student can CHECK his/her understanding of the material and sometimes the exercises are not about advanced aspects of a concept, sometimes it is the core material. Even if the solution manual only contained a simple answer without the work. Not only would it help tremendously but the purpose of doing the exercises would be preserved; that is the student getting his/her "hands dirty" and working out a problem.
For the love everything good and pure in this universe, I really wish writers of mathematical books would stop using statements like "clearly this works" or "it is easy to see", "it is obvious" etc. While that may be true for you and your brilliant circle of colleagues, everything is not always clear and obvious to your readers. Save all of that ambiguity for your research paper.
A great book should deliver in two areas; it should challenge and it should inform. The challenge is there, no doubt. However in some ways it fails to inform the reader. The authors should really think about releasing a students solution manual to help students learn better. I take away two stars for the reasons stated about.
Most recent customer reviews
My algorithms class was hard (what algorithms class isn't), and I'm not always an ideal student.Read more
* A few pages have no printing on them at all
* Very thin paper, so that the printing from the back page...Read more