| Robert Sedgewick是普林斯顿大学的计算机科学教授。他于斯坦福大学获得博士学位（师从Donald E.Knuth）。Sedgewick是Adobe Systems公司的主管，并且作为研究人员还曾供职于施乐的洛阿尔托研究中心（Xerox PARC）、美国国防部防御分析研究所（the instituter for Defense Analyses）和法国国立计算机与自动化研究所（INRIA）。Sedgewick（与Philippe Flajolet）还合著有《An Introduction to the Analysis of Aigorithms》一书。 |
| Fundamentals Chapter 1.Introducion 1.1 Algorithms 1.2 A Sample Problem-Connectivity 1.3 Union-Find Algorithms 1.4 Perspective 1.5 Summary of Topics Chapter 2.Principles of Algorithm Analysis 2.1 Implementation and Empirical Analysis 2.2 Analysis of Algorithms 2.3 Growth to Functions 2.4 Big-Oh notatiojn 2.5 Basic Recurrences 2.6 Examples of Algorithm Analysis 2.7 Guarantees,Predictions,and Limitations Data Structres Chapter 3.Elementary Data Structures 3.1 Building Blocks 3.2 Arrays 3.3 Linded Lists 3.4 Elementary List Processing 3.5 Memory Allocation for Lists 3.6 Strings 3.7 Compound Data Structures Chapter 4.Abstract Data Types 4.1 Abstract Objects and Collections of Objects 4.2 Pushdown Stack ADT 4.3 Examples of Stack ADT Clients 4.4 Stack ADT Implementations 4.5 Creation of a New ADT 4.6 FIFD Quesues and Generalized Queues 4.7 Duplicate and Index Items 4.8 First-Class ADTs 4.9 Application-Based ADT Example 4.10 Perpective Chappter 5.Recursion and Tress 5.1 Recursive Algorithms 5.2 Divide and Conquer 5.3 Dynamic Programming 5.4 Tress 5.5 Machematical Properties of Tress 5.6 Tree Traversal 5.7 Recursive Binary-Tree Algorithms 5.8 Graph Traversal 5.9 Perspective Sorting Searching Index |
内容加载中，请稍后...
商品评论（0条）