An Introduction to the Analysis of Algorithms (絕)
- 20本以上，享 8.5折
售價
$
洽詢
- 一般書籍
- ISBN：9780201400090
- 作者：Robert Sedgewick, Philippe Flajolet
- 版次：1
- 年份：1996
- 出版商：Pearson Education
- 頁數/規格：492頁
書籍介紹
本書特色
目錄
作者介紹
Description
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 being done to meet these challenges.
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 being done to meet these challenges.
Features
- 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
Table of Contents
1. Analysis of Algorithms
2. Recurrence Relations
3. Generating Functions
4. Asymptotic Approximations
5. Trees
6. Permutations
7. Strings and Tries
8. Words and Maps
1. Analysis of Algorithms
2. Recurrence Relations
3. Generating Functions
4. Asymptotic Approximations
5. Trees
6. Permutations
7. Strings and Tries
8. Words and Maps
Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.
