An Introduction to the Analysis of Algorithms
Description:... Despite growing interest in the mathematical analysis of algorithms, basic information on methods and models has rarely been directly accessible to practitioners, researchers, or students. This book organizes and presents that knowledge, fully introducing today's primary techniques for mathematically analyzing algorithms.
Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematical and computer science material, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They focus on "average-case" or "probabilistic" analysis, while also covering tools for "worst case" or "complexity" analysis. Improvements in this edition include:
- Upgraded figures and code
- Newer style for presenting much of the text's math
- An all-new chapter on trees
This book's thorough, self-contained coverage will help readers appreciate the field's challenges, prepare them for advanced results covered in Donald Knuth's books, and provide the background they need to keep abreast of new research. Coverage includes: recurrences, generating functions, asymptotics, trees, strings, maps, sorting, tree search, string search, and hashing algorithms. Ideal for junior- or senior-level courses on mathematical analysis of algorithms, this book will also be useful in courses on discrete mathematics for computer scientists, and in introducing mathematics students to computer science principles related to algorithms and data structures.
Show description