数据结构与算法分析C++描述

出版时间：2002-9  出版社：清华大学出版社  作者：Mark Allen Weiss  页数：588  
Tag标签：无  

内容概要

　　此书是作者1996年出版“Algorithm，Data Structures，and Problem Solving with C++”的缩编本，原书正文807页，作者对内容包括算法重新作了编排，《大学计算机教育国外著名教材教参系列：Data Structures & Algorithm Analysis in C++》正文575页共分12章，其内容依次为C++简介；算法分析；表、栈与队列；树；散列 ；优先队列（堆）；排序；并查集；图；算法设计技术；缓冲分析；高级数据结构和实现。附录中给出类设计的模板。　　《大学计算机教育国外著名教材教参系列：Data Structures & Algorithm Analysis in C++》内容基本符合目前《数据结构与算法》大纲的要求，比较适合当前的教学需要。内容编排上较为合理，篇幅较小，叙述清楚，适合于本科高年级和研究生使用。

书籍目录

Chapter 1 Introduction1.1 Whats the Book About?1.2 Mathematics Review1.3 A Brief Introduction to Recursion1.4 C++ Classes1.5 C++ Details1.6 Templates1.7 Using MatricesChapter 2 Algorithm Analysis2.1 Mathematical Background2.2 Model2.3 What to Analyze2.4 Running Time CalculationsChapter 3 Lists,Stacks,and Queues3.1 Abstract Data Types（ADTS）3.2 The List ADT3.3 The Stack ADT3.4 The Queue ADT Chapter 4 Trees4.1 Preliminaries4.2 Binary Trees4.3 The Search Tree ADT——Binary Search Trees4.4 AVL Trees4.5 Splay Trees4.6 Tree Traversals（Revisited）4.7 B-Trees Chapter 5 Hashing5.1 General Idea5.2 Hash Function5.3 Separate Chaining5.4 Open Addressing5.5 Rehashing5.6 Extendible HashingChapter 6 Priority Queues（Heaps）6.1 Model6.2 Simple Implementations6.3 Binary Heap6.4 Applicatins of Priority Queues6.5 d-Heaps6.6 Leftist Heaps6.7 Skew Heaps6.8 Binomial QueuesChapter 7 Sorting7.1 Preliminaries7.2 Insertion Sort7.3 A Lower Bound for Simple Sorting Algorithms7.4 Shellsort7.5 Heapsort7.6 Mergesort7.7 Quicksort7.8 Indirect Soring7.9 A Generl Lower Bound for Sorting7.10 Bucket Sort7.11 External SortingChapter 8 The Disjoint Set ADT8.1 Equivalence Relations8.2 The Dynamic Equivalence Problem8.3 Basic Data Structure8.4 Smart Union Algorithms8.5 Path Compression8.6 Worst Case for Union-by-Rank and Path Compression8.7　An Application Chapter 9 Graph Algorithms9.1 Definitions9.2 Topological Sort9.3 Shortest-Path Algorithms9.4 Network Flow Problems9.5 Minimum Spanning Tree9.6 Applications of Depth-First Search9.7 Introduction to NP-CompletenessChapter 10 Algorithm Design Techniques10.1 Greedy Algorithms10.2 Divide and Conquer10.3 Dynamic Programming10.4 Randomized Algorithms10.5 Backtracking AlgorithmsChapter 11 Amortized Analysis11.1 An Unrelated Puzzle11.2 Binomial Queues11.3 Skew Heaps11.4 Fibonacci Heaps11.5 Splay TreesChapter 12 Advanced Data Structures and Implementation12.1 Top-Down Splay Trees12.2 Red-Black Trees12.3 Daterministic Skip Lists12.4 AA-Trees12.5 Treaps12.6 k-d Trees12.7 Pairing HeapsAppendix A The Standard Template LibraryA.1 IntroductionA.2 Basic STL ConceptsA.3 Unordered Sequences：vector and listA.4 SetsA.5 MapsA.6 Example：Generating a ConcordanceA.7 Example：Shortest-Path CalculationA.8 Other STL FeaturesAppendix B vector and string ClassesB.1 First-Class versus Second-Class ObjectsB.2 vector ClassB.3 string ClassIndex