{"product_id":"9780133373486","title":"An Introduction to the Analysis of Algorithms: Introdu Analysi Algori_p2","description":"\u003cp\u003eDespite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. \u003cb\u003e \u003ci\u003e \u003cb\u003eAn Introduction to the Analysis of Algorithms, Second Edition, \u003c\/b\u003e \u003c\/i\u003e \u003c\/b\u003eorganizes and presents that knowledge, fully introducing primary techniques and results in the field.\u003c\/p\u003e  \u003cp\u003e \u003c\/p\u003e  \u003cp\u003eRobert 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.\u003c\/p\u003e  \u003cp\u003e \u003c\/p\u003e  \u003cp\u003eTechniques 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.\u003c\/p\u003e  \u003cp\u003e \u003c\/p\u003e  \u003cp\u003eImprovements and additions in this new edition include\u003c\/p\u003e  \u003cul\u003e  \u003cli\u003e  Upgraded figures and code  \u003c\/li\u003e\n\u003cli\u003e  An all-new chapter introducing analytic combinatorics  \u003c\/li\u003e\n\u003cli\u003e  Simplified derivations via analytic combinatorics throughout \u003c\/li\u003e \u003c\/ul\u003e  \u003cp\u003eThe book’s thorough, self-contained coverage will help readers appreciate the field’s challenges, prepare them for advanced results—covered in their monograph \u003ci\u003eAnalytic Combinatorics \u003c\/i\u003eand in Donald Knuth’s \u003ci\u003eThe Art of Computer Programming \u003c\/i\u003ebooks—and provide the background they need to keep abreast of new research.\u003c\/p\u003e  \u003cp\u003e \u003c\/p\u003e  \u003cp\u003e\"[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.\"\u003c\/p\u003e  \u003cp\u003e \u003ci\u003e—From the Foreword by \u003cb\u003eDonald E. Knuth\u003c\/b\u003e \u003c\/i\u003e \u003c\/p\u003e","brand":"Pearson Education","offers":[{"title":"Default Title","offer_id":47106436759792,"sku":"9780133373486","price":59.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9780133373486_p0.jpg?v=1763640840","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9780133373486","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}