算法I~IV（C++实现）—基础、数据结构、排序和搜索（第三版 影印版） (2008 年度畅销榜NO.897 )

本套教学用书的特点：
权威性——教育部高等教育司推荐、教育部高等学校信息科学与技术引进教材专家组遴选
系统性——覆盖计算机专业主干课程和非计算机专业计算机基础课程
先进性——著名计算机专家近两年的最新著作，内容体系先进
经济性——价格与国内自编教材相当、是国内引进教材价格最低的\r\n

Fundamentals\r\n\r\nChapter 1.Introduction \r\n\r\n1.1 Algorithms　\r\n1.2 A Sample Problem-Connectivity　\r\n1.3 Union-Find Algorithms　\r\n1.4 Perspective　\r\n1.5 Summary of Topics　\r\n\r\nChapter 2.Principles of Algorithm Analysis \r\n\r\n2.1 Implementation and Empirical Analysis　\r\n2.2 Analysis of Algorithms　\r\n2.3 Growth of Functions　\r\n2.4 Big-Oh Notation　\r\n2.5 Basic Recurrences　\r\n2.6 Examples of Algorithm Analysis　\r\n2.7 Guarantees, Predictions, and Limitations　\r\n\r\nData Structures\r\n\r\nChapter 3.Elementary Data Structures \r\n\r\n3.1 Building Blocks　\r\n3.2 Arrays' S3\r\n3.3 Linked Lists　\r\n3.4 Elementary List Processing　\r\n3.5 Memory Allocation for Lists\r\n3.6 Strings　\r\n3.7 Compound Data Structures　\r\n\r\nChapter 4.Abstract Data Types \r\n\r\n4.1 Abstract Objects and Collections of Objects　\r\n4.2 Pushdown Stack ADT\r\n4.3 Examples of Stack ADT Clients　\r\n4.4 Stack ADT Implementations　\r\n4.S Creation of a New ADT　\r\n4.6 FIFO Queues and Generalized Queues\r\n4.7 Duplicate and Index Items　\r\n4.8 First-Class ADTs　\r\n4.9 Application-Based ADT Example\r\n4.10 Perspective\r\n\r\nChapter 5.Recursion and Trees \r\n\r\n5.1 Recursive Algorithms\r\n5.2 Divide and Conquer　\r\n5.3 Dynamic Programming\r\n5.4 Trees　\r\n5.5 Mathematical Properties of Trees　\r\n5.6 Tree Traversal\r\n5.7 Recursive Binary-Tree Algorithms　\r\n5.8 Graph Traversal\r\n5.9 Perspective\r\n\r\nSorting\r\n\r\nChapter 6.Elementary Sorting Methods \r\n\r\n6.1 Rules of the Game　\r\n6.2 Selection Sort\r\n6.3 Insertion Sort\r\n6.4 Bubble Sort\r\n6.5 Performance Characteristics of Elementary Sorts　\r\n6.6 Shellsort \r\n6.7 Sorting Other Types of Data\r\n6.8 Index and Pointer Sorting\r\n6.9 Sorting Linked Lists\r\n6.10 Key-Indexed Counting　\r\n\r\nChapter 7.Quicksort \r\n\r\n7.1 The Basic Algorithm　\r\n7.2 Performance Characteristics of Quicksort \r\n7.3 Stack Size　\r\n7.4 Small Subfiles \r\n7.5 Median-of-Three Partitioning\r\n7.6 Duplicate Keys　\r\n7.7 Strings and Vectors　\r\n7.8 Selection\r\n\r\nChapter 8.Merging and Mergesort \r\n\r\n8.1 Two-Way Merging　\r\n8.2 Abstract In-Place Merge\r\n8.3 Top-Down Mergesort \r\n8.4 Improvements to the Basic Algorithm　\r\n8.5 Bottom-UP Mergesort\r\n8.6 Performance Characteristics of Mergesort \r\n8.7 Linked-List Implementations of Mergesort \r\n8.8 Recursion Revisited　\r\n\r\nChapter 9.Priority Queues and Heapsort \r\n\r\n9.1 Elementary Implementations\r\n9.2 Heap Data Structure\r\n9.3 Algorithms on Heaps\r\n9.4 Heapsort \r\n9.5 Priority-Queue ADT\r\n9.6 Priority Queues for Index Items\r\n9.7 Binomial Queues\r\n\r\nChapter 10.Radix Sorting \r\n\r\n10.1 Bits, Bytes, and Words　\r\n10.2 Binary Quicksort \r\n10.3 MSD Radis Sort　\r\n10.4 Three-Way Radin Quicksort \r\n10.S LSD Radis Sort　\r\n10.6 Performance Characteristics of Radix Sorts\r\n10.7 Sublinear-Time Sorts　\r\n\r\nChapter 11.Spedal-Purpose Sorts \r\n\r\n11.1 Batcher's Odd-Even Mergesort　\r\n11.2 Sorting Networks　\r\n11.3 External Sorting\r\n11.4 Sort-Merge Implementations\r\n11.5 Parallel Sort/Merge　\r\n\r\nSearching\r\n\r\nChapter 12.Symbol Tables and BSTs \r\n\r\n12.1 Symbol-Table Abstract Data Type\r\n12.2 Key-Indexed Search\r\n12.3 Sequential Search\r\n12.4 Binary Search　\r\n12.5 Binary Search Trees (BSTs)　\r\n12.6 Performance Characteristics of BSTs\r\n12.7 Index Implementations with Symbol Tables　\r\n12.8 Insertion at the Root in BSTs　\r\n12.9 BST Implementations of Other ADT Functinns\r\n\r\nChapter 13.Balanced Trees \r\n\r\n13.1 Randomized BSTs　\r\n13.2 Splay BSTs\r\n13.3 Top-Down 2-3-4 Trees　\r\n13.4 Red-Black Trees\r\n13.5 Skip Lists\r\n13.6 Performance Characteristics\r\n\r\nChapter 14.Hashing \r\n\r\n14.1 Hash Functions\r\n14.2 Separate Chaining\r\n14.3 Linear Probing\r\n14.4 Double Hashing\r\n14.5 Dynadric Hash Tables　\r\n14.6 Perspective　\r\n\r\nChapter 15.Radit Search \r\n\r\n15.1 Digital Search Trees　\r\n15.2 Tries　\r\n15.3 Patricia Tries　\r\n15.4 Multiway Tries and TSTs　\r\n15.5 Text String Index Applications\r\n\r\nChapter 16.External Searching \r\n\r\n16.1 Rules of the Game\r\n16.2 Indexed Sequential Access\r\n16.3 B Trees\r\n16.4 Extendible Hashing\r\n16.5 Perspective\r\nIndex