Introduction to the Analysis of Algorithms, An, 2nd edition

Published by Addison-Wesley Professional (January 18, 2013) © 2013

  • Robert Sedgewick Princeton University
  • Philippe Flajolet
Products list
  • Available for purchase from all major ebook resellers, including InformIT.com
Products list

Details

  • A print text
  • Free shipping
  • Also available for purchase as an ebook from all major ebook resellers, including InformIT.com

This product is expected to ship within 3-6 business days for US and 5-10 business days for Canadian customers.

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. Authors Robert Sedgewick and the late Philippe Flajolet 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. Improvements and additions in this new edition include upgraded figures and code, an all-new chapter introducing analytic combinatorics, and simplified derivations via analytic combinatorics throughout. The book’s thorough, self-contained coverage will help readers appreciate the field’s challenges and prepare them for advanced study.

  • Chapter 1: Analysis of Algorithms
  • Chapter 2: Recurrence Relations
  • Chapter 3: Generating Functions
  • Chapter 4: Asymptotic Approximations
  • Chapter 5: Analytic Combinatorics
  • Chapter 6: Trees
  • Chapter 7: Permutations
  • Chapter 8: Strings and Tries
  • Chapter 9: Words and Mappings
  • List of Theorems
  • List of Tables
  • List of Figures
  • Index

Need help? Get in touch