本书内容包括表、栈、队列、树、散列表、优先队列、排序、不相交集算法、图论算法、算法分析、算法设计、摊还分析、查找树算法、k-d树和配对堆等。

Mark Allen Weiss，1987年在普林斯顿大学获得计算机博士学位，师从著名算法大师Robert Sedgewick，现任美国佛罗里达国际大学计算与信息科学学院教授。

Chapter 1 Introducion
1.1 What's the Book About?
1.2 Mathematics Review
1.3 A Brief Introduction to Recursion
1.4 C++ Classes
1.5 C++ Details
1.6 Templates
1.7 Using Matrices
Chapter 2 Algorithm Analysis
2.1 Mathematical Background
2.2 Model
2.3 What to Anayze
2.4 Running Time Calulations
Chapter 3 Lists,Stacks,and Queues
……
Chapter 4 Trees
Chapter 5 Hashing
Chapter 6 Prority Queues(Heaps)
Chapter 7 Sorting
Chapter 8 The Disjoint Set Class
Chapter 9 Graph Algorithms
Chapter 10 Algorithm Design Techniques
Chapter 11 Amortized Analysis
Chapter 12 Advanced Data Sturctures and Implementation
Appendix A:Separate Compilation of Class Templates
Index