An Introduction to the Analysis of Algorithms

Customers who bought this book also bought:

Graph Theory (Graduate Texts in Mathematics, 173); Reinhard Diestel
Data Structures and Algorithms; Alfred V. Aho, et al
Set Theory and Logic; Robert R. Stoll
Algorithms in C : Fundamentals, Data Structures, Sorting, Searching; Robert Sedgewick

Reviews
Book Description
"People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobsdone more quickly and more economically.... The appearance of this long-awaited [book] is therefore most welcome. Its authors are not only worldwide leaders of the field, they also are masters of exposition." --D. E. Knuth

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. 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 being done to meet these challenges.

Highlights:
Thorough, self-contained coverage for students and professionals in computer science and mathematics Focus on mathematical techniques of analysis Basic preparation for the advanced results covered in Knuth's books and the research literature Classical approaches and results in the analysis of algorithms

Synopsis
A thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. This book draws upon classical mathematical material from discrete mathematics, elementary real analysis, and combinations and discusses properties of discrete structures and covers the analysis of a variety of classic forting, searching, and string processing algorithms.

Back to General
Back to Algorithms
Back to Main Index