Rent $16.82
- List Price: $135.00
- Save: $118.18 (88%)
- FREE return shipping at the end of the semester.
- Access codes and supplements are not guaranteed with rentals.
Rented from Amazon Warehouse
Fulfilled by Amazon
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and .
If you're a seller, Fulfillment by Amazon can help you grow your business. Learn more about the program.
Buy new:
$93.00$93.00
FREE delivery:
Tuesday, Feb 14
Ships from: Amazon Sold by: Mpg Health Parkway, Llc
Other Sellers on Amazon
100% positive over last 12 months

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 4th Edition
Price | New from | Used from |
- Kindle
$84.99 Read with Our Free App - Hardcover
$16.82 - $99.68
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
- Dimensions8.25 x 2.01 x 9.31 inches
- Print length1312 pages
![]() |
Frequently bought together
- +
- +
More items to explore
Editorial Reviews
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 : 4.8 pounds
- Dimensions : 8.25 x 2.01 x 9.31 inches
- Best Sellers Rank: #17,466 in Books (See Top 100 in Books)
- #1 in Programming Algorithms
- #1 in Computer Algorithms
- #5 in Computer Programming Languages
- 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
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon
Reviewed in the United States on November 7, 2022
-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Just writing some code to solve the problem is not sufficient at all. We should be able to solve the problem optimally, thinking out of the box while challenging the orthodox thinking and proving the correctness and analyzing the running time of the solution mathematically. This book covers all of them in one go.
The only downside I see is in the binding which is not that good in the fourth edition compared to the previous third edition. Nevertheless, It's well worth the payoff ! Go ahead and read it without any hesitations !
I would instantly buy this book again if they separated it into two volumes, and used better quality.
When using it as a reference I'm usually in either front half, or back half, anyway. It would be so much nicer to grab off the shelf and use as two separate volumes.

Reviewed in the United States 🇺🇸 on November 7, 2022



There’s “arguably” barely any changes since the previous edition so you almost might as well save yourself a buck on that end.
Top reviews from other countries

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!



Reviewed in Brazil 🇧🇷 on November 18, 2022


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

Excellent and unmatched content.
High quality printing. Looks and feels good.
What I didn't like:
First printing has too many errors. See errata.
Voluminous - You need stamina to hold and read the book. Could be printed in 3 parts.
Request:
Kindle book should be provided free for those who buy physical book, just like manning publishers, as kindle version will always have the error corrected latest book which is alps easy to hold and search.

Se estiver começando do zero, recomendo ler antes o livro: A Common-Sense Guide to Data Structures and Algorithms, do Jay Wengrow.