VERY GOOD: The book is in very good condition, showing only the slightest signs of use and wear (slight bend in the upper spine). The pages are clean, the binding is tight, and the cover corners are straight.
Product Details
From the back cover: "This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatorics, as well as from classical computer science material, including algorithms and data structures. They focus on 'average-case' or 'probabilistic' analysis, although they also cover the basic mathematical tools required for 'worst-case' or 'complexity' analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms.
"Despite the large interest in the mathematical analysis of algorithms, basic information on methods and models in widespread use has not been directly accessible for work or study in the field. The authors here address this need, combining a body of material that gives the reader both an appreciation for the challenges of the field and the requisite background for keeping abreast of the new research to meet these challenges."
BRIEF CONTENTS
Analysis of Algorithms
Recurrence Relations
Generating Functions
Asymptotic Approximations
Trees
Permutations
Strings and Trees
Words and Maps
The book concludes with a List of Theorems and an Index.
