Title
Introduction to the Analysis of Algorithms, An,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
Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing primary techniques and results in the field.Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematics and computer science, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They emphasize the mathematics needed to support scientific studies that can serve as the basis for predicting algorithm performance and for comparing different algorithms on the basis of performance.Techniques covered in the first half of the book include recurrences, generating functions, asymptotics, and analytic combinatorics. Structures studied in the second half of the book include permutations, trees, strings, tries, and mappings. Numerous examples are included throughout to illustrate applications to the analysis of algorithms that are playing a critical role in the evolution of our modern computational infrastructure.Improvements and additions in this new edition include Upgraded figures and code An allnew chapter introducing analytic combinatorics Simplified derivations via analytic combinatorics throughoutThe books thorough, selfcontained coverage will help readers appreciate the fields challenges, prepare them for advanced resultscovered in their monograph Analytic Combinatorics and in Donald Knuths The Art of Computer Programming booksand provide the background they need to keep abreast of new research.'[Sedgewick and Flajolet] are not only worldwide leaders of the field, they also are masters of exposition. I am sure that every serious computer scientist will find this book rewarding in many ways.'From the Foreword by Donald E. Knuth
⚠️ 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 topics are covered in 'Introduction to the Analysis of Algorithms'? A: The book covers various topics including recurrences, generating functions, asymptotics, and analytic combinatorics, along with structures such as permutations, trees, strings, tries, and mappings.
- Q: Who are the authors of this book? A: The book is authored by Robert Sedgewick and the late Philippe Flajolet, both renowned in the field of algorithm analysis.
- Q: Is this book suitable for beginners? A: While the book is comprehensive and self-contained, it is best suited for readers with a basic understanding of mathematics and computer science.
- Q: What is the publication date of the second edition? A: The second edition of 'Introduction to the Analysis of Algorithms' was published on January 18, 2013.
- Q: How many pages does the book contain? A: The book contains a total of 592 pages.
- Q: What type of binding does this book have? A: This book is available in hardcover binding, ensuring durability for long-term use.
- Q: Are there any new features in the second edition? A: Yes, the second edition includes upgraded figures, code, and an all-new chapter introducing analytic combinatorics.
- Q: Does the book include examples for better understanding? A: Yes, numerous examples are included throughout the book to illustrate applications related to the analysis of algorithms.
- Q: What is the item condition of the book? A: The book is listed as 'New', indicating it has not been previously owned or used.
- Q: Can this book help in understanding advanced topics in algorithms? A: Yes, it provides foundational knowledge that prepares readers for advanced topics covered in related works like 'Analytic Combinatorics' and Donald Knuth’s 'The Art of Computer Programming'.