
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer – no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera, scan the code below and download the Kindle app.

Introduction to Algorithms, fourth edition Hardcover – April 5 2022
Amazon Price | New from | Used from |
Kindle Edition
"Please retry" | — | — |
- Kindle Edition
$139.99 Read with Our Free App - Hardcover
$157.08
Purchase options and add-ons
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.
New for the fourth edition
- New chapters on matchings in bipartite graphs, online algorithms, and machine learning
- New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays
- 140 new exercises and 22 new problems
- Reader feedback–informed improvements to old problems
- Clearer, more personal, and gender-neutral writing style
- Color added to improve visual presentation
- Notes, bibliography, and index updated to reflect developments in the field
- Website with new supplementary material
Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.
- ISBN-10026204630X
- ISBN-13978-0262046305
- Edition4th
- PublisherThe MIT Press
- Publication dateApril 5 2022
- LanguageEnglish
- Dimensions20.96 x 5.11 x 23.65 cm
- Print length1312 pages
Frequently bought together

Customers who viewed this item also viewed
Product description
About the Author
Product details
- Publisher : The MIT Press; 4th edition (April 5 2022)
- Language : English
- Hardcover : 1312 pages
- ISBN-10 : 026204630X
- ISBN-13 : 978-0262046305
- Item weight : 2.18 kg
- Dimensions : 20.96 x 5.11 x 23.65 cm
- Best Sellers Rank: #47,200 in Books (See Top 100 in Books)
- #6 in Algorithms Textbooks
- #22 in Computer Science Textbooks
- #40 in Computer Algorithms
- Customer Reviews:
About the author

Thomas H. Cormen is Emeritus Professor and former Chair of the Dartmouth College Department of Computer Science and former director of the Dartmouth College Institute for Writing and Rhetoric. He received the B.S.E. degree in Electrical Engineering and Computer Science from Princeton University in 1978 and the S.M. and Ph.D. degrees in Electrical Engineering and Computer Science from MIT in 1986 and 1993, respectively. He is coauthor of the leading textbook on computer algorithms, Introduction to Algorithms, which he wrote with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book, now in its fourth edition, has been translated into several languages. He is also the author of Algorithms Unlocked, a gentle introduction to understanding computer algorithms and how they relate to real-world problems.
Outside computer science, Cormen likes skating (inline and nordic), paddling, and cooking and eating barbecue. He considers himself the world's worst electrician who has a Ph.D. in electrical engineering.
Customer reviews
-
Top reviews
Top reviews from Canada
There was a problem filtering reviews right now. Please try again later.
They are mostly quite similar, but there were a reasonable number changes with regards to fixing errors and the style of writing. If you do not have time to check the errata for 3rd edition, most of the errors have been fixed in 4th edition. Moreover, all the material for 3rd edition that is now gone (as it was not as useful as it could be to an average reader) is available at the website, which means you can always look it up. Some new topics have been added, such as Machine Learning, but I think that you would buy a specialized book for ML in case you wanted to study the topic in depth. Still, it is (somewhat) useful if you are doing a quick brush-up before the interview - you have basic algorithms for ML (look up the index of the textbook before buying so that you know what is included) and your typical DSA interview topics in the same place.
Giving it 4 stars as I'd prefer the 3rd edition due to the price difference - I paid CAD 160 for the 4th edition as a gift, and only CAD 63 for a second-hand 3rd edition for my algorithms course: 100 dollar difference for a student is quite a lot, to be honest. Although I'd prefer to have my textbook without any errors and in color, I'd rather look up the errata rather than pay 100 dollars more. I think that by the time I get a job, the price will decrease and will be able to get a much better offer on 4th edition in case I want it.
Top reviews from other countries

Can u please be a bit careful with your book deliveries ?

The only difficulties experienced so far are in reading through and attempting to understand some of the more mathematical proofs - although that is laziness on my part, the appendices section looks like it will be very helpful in bringing a rusty mind back up to speed with mathematical lexicon.
The only minor criticism is merely a conflict with the authors' collection assertion to avoid providing solutions - seemingly on the basis that students might be find the compulsion to look up sample answers to the problems an irresistible temptation! Perhaps the lazy or poorly motivated would do so - and would certainly end up rewarded with the diminishing benefits and future struggle that that specific attitude would deserve.
However, those learners who are prepared to put in the mileage of a good 30 minute attempt at a tougher problem should be able to verify if their own work is correct - and get an idea of where they might be going wrong. Personally, not having the luxury or privilege to access a lecturer, instructor, or mentor (and with the sending of solutions not being encouraged), it is sometimes frustrating - although there are obviously large numbers GitHub accounts which are starting to farm out 'tentative solutions' for every problem in the book. It is difficult and frustrating to try and elucidate what solutions are worthwhile in looking at when struggling - and it would be more convenient to compare my own attempts with answers from a credible source.
Anyway, apart from that minor (extended) quibble, I would encourage anyone who is learning about algorithms to make purchasing and working through this book their number one priority!

I would never order from them again. The pages are also bent but i can live with that
At least the book is good and readable but horrible experience



Reviewed in India 🇮🇳 on December 15, 2022


I will be so grateful if you share these pages with me.😖