xxxfreesexmoves-haodiaocao这里只有精品视频-欧美性受黑人性爽-欧美性受xxxxxx黑人xyx性爽|www.jsyyzsb.com

本書(shū)內(nèi)容包括表、棧、隊(duì)列、樹(shù)、散列表、優(yōu)先隊(duì)列、排序、不相交集算法、圖論算法、算法分析、算法設(shè)計(jì)、攤還分析、查找樹(shù)算法、k-d樹(shù)和配對(duì)堆等。

Mark Allen Weiss，1987年在普林斯頓大學(xué)獲得計(jì)算機(jī)博士學(xué)位，師從著名算法大師Robert Sedgewick，現(xiàn)任美國(guó)佛羅里達(dá)國(guó)際大學(xué)計(jì)算與信息科學(xué)學(xué)院教授。

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