Title
Introduction to Algorithms, Second Edition,Used
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 updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for selfstudy by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds.Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.
⚠️ 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: How many pages does this book have? A: This book has one thousand fifty-six pages. It provides extensive coverage of algorithms and includes numerous exercises.
- Q: What are the dimensions of the book? A: The book measures eight point nineteen inches in length, two point twenty-eight inches in width, and nine point twenty-nine inches in height. These dimensions make it a standard hardcover size.
- Q: What is the binding type of this book? A: This book is hardcover bound. This type of binding enhances durability and makes it suitable for frequent use.
- Q: Who is the author of this book? A: The author of this book is Thomas H. Cormen. He is well-known for his contributions to computer science and algorithms.
- Q: What is the main subject of this book? A: This book focuses on algorithms, specifically designed for undergraduate and graduate courses. It also serves as a self-study resource for professionals.
- Q: Is this book suitable for beginners? A: Yes, this book is suitable for beginners as well as advanced readers. It offers a comprehensive introduction to algorithms with accessible explanations.
- Q: Can this book help with self-study? A: Yes, this book is ideal for self-study. It discusses both engineering issues and mathematical aspects of algorithm design.
- Q: What kind of exercises does this book include? A: The book includes over nine hundred exercises and one hundred fifty-five problems. These are designed to reinforce learning and understanding of algorithm concepts.
- Q: Is there any new content in this edition? A: Yes, this edition includes new chapters on computing algorithms and probabilistic analysis. It has been updated for clarity and expanded coverage.
- Q: How should I care for this book? A: To care for this book, keep it in a dry place and avoid exposing it to direct sunlight. This will help maintain its condition over time.
- Q: What if the book arrives damaged? A: If the book arrives damaged, you should contact the seller for a return or replacement. Most sellers have policies in place for such issues.
- Q: Is this book appropriate for kids? A: No, this book is not specifically designed for kids. It targets undergraduate and graduate students or technical professionals.
- Q: Are there practical applications in this book? A: Yes, the book discusses practical applications of algorithms in various fields. It covers design techniques and application areas to enhance understanding.
- Q: Does this book include pseudocode? A: Yes, the book presents algorithms in pseudocode. This makes it accessible for students from different programming backgrounds.
- Q: What types of algorithms are covered in this book? A: The book covers a rich variety of algorithms, including sorting, searching, and randomized algorithms. It provides in-depth analysis and design techniques.
- Q: Can instructors use this book flexibly in courses? A: Yes, instructors can organize the chapters flexibly. Each chapter is independent, allowing for customized course structures.