Title
Introduction to Algorithms, 3rd Edition (Mit Press),New
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edgebased flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called 'DivideandConquer'), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edgebased flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What are the dimensions of this book? A: The book measures nine point zero nine inches in length, eight point one nine inches in width, and two point zero six inches in height.
- Q: How many pages does this book have? A: This book has one thousand two hundred ninety-two pages, providing extensive coverage of algorithms.
- Q: What type of binding does this book have? A: This book is bound in hardcover, ensuring durability for repeated use.
- Q: Who is the author of this book? A: The author of this book is Thomas H. Cormen, a well-respected figure in the field of computer science.
- Q: What topics does this book cover? A: This book covers a broad range of algorithms, including dynamic programming, multithreaded algorithms, and edge-based flow.
- Q: Is this book suitable for beginners? A: Yes, this book is accessible to readers at all levels, including beginners with some programming experience.
- Q: Can I use this book for self-study? A: Yes, each chapter is self-contained, making it ideal for independent study.
- Q: What reading level is this book appropriate for? A: This book is suitable for college students and professionals in computer science.
- Q: How should I store this book? A: Store this book in a cool, dry place, standing upright on a shelf to prevent damage.
- Q: What care does the hardcover require? A: To maintain the hardcover, keep it clean by wiping it with a dry cloth and avoid exposure to moisture.
- Q: What if the book arrives damaged? A: If the book arrives damaged, you should contact the seller for return or replacement options.
- Q: Is there a warranty on this book? A: No, there is typically no warranty on books, but check the seller's return policy.
- Q: Can I return this book if I'm not satisfied? A: Yes, most sellers offer a return policy; check the specific return guidelines at the time of purchase.
- Q: Is this book suitable for professional reference? A: Yes, this book is a standard reference for professionals in the field of algorithms and computer science.
- Q: How does this edition differ from previous ones? A: This third edition includes substantial new material and updated content compared to previous editions.