计算机算法 设计与分析导论 英文版

1 (p1): 1 Analyzing Algorithms and Problems:Principles and Examples
2 (p1-2): 1.1 Introduction
3 (p1-3): 1.2 Java as an Algorithm Language
7 (p2): Preface
11 (p2-2): 1.3 Mathematical Background
30 (p2-3): 1.4 Analyzing Algorithms and Problems
43 (p2-4): 1.5 Classifying Functions by Their Asymptotic Growth Rates
53 (p2-5): 1.6 Searching an Ordered Array
61 (p2-6): Exercises
67 (p2-7): Notes and References
69 (p3): 2 Data Abstraction and Basic Data Structures
70 (p3-2): 2.1 Introduction
71 (p3-3): 2.2 ADT Specification and Design Techniques
73 (p3-4): 2.3 Elementary ADTs--Lists and Trees
86 (p3-5): 2.4 Stacks and Queues
89 (p3-6): 2.5 ADTs for Dynamic Sets
95 (p3-7): Exercises
100 (p3-8): Notes and References
101 (p4): 3 Recursion and Induction
102 (p4-2): 3.1 Introduction
102 (p4-3): 3.2 Recursive Procedures
108 (p4-4): 3.3 What Is a Proof?
111 (p4-5): 3.4 Induction Proofs
118 (p4-6): 3.5 Proving Correctness of Procedures
130 (p4-7): 3.6 Recurrence Equations
134 (p4-8): 3.7 Recursion Trees
141 (p4-9): Exercises
146 (p4-10): Notes and References
149 (p5): 4 Sorting
150 (p5-2): 4.1 Introduction
151 (p5-3): 4.2 Insertion Sort
157 (p5-4): 4.3 Divide and Conquer
159 (p5-5): 4.4 Quicksort
171 (p5-6): 4.5 Merging Sorted Sequences
174 (p5-7): 4.6 Mergesort
178 (p5-8): 4.7 Lower Bounds for Sorting by Comparision of Keys
182 (p5-9): 4.8 Heapsort
197 (p5-10): 4.10 Shellsort
197 (p5-11): 4.9 Comparison of Four Sorting Algorithms
201 (p5-12): 4.11 Radix Sorting
206 (p5-13): Exercises
221 (p5-14): Programs
221 (p5-15): Notes and References
223 (p6): 5 Selection and Adversary Arguments
224 (p6-2): 5.1 Introduction
226 (p6-3): 5.2 Finding max and min
229 (p6-4): 5.3 Finding the Second-Largest Key
233 (p6-5): 5.4 The Selection Problem
238 (p6-6): 5.5 A Lower Bound for Finding the Median
240 (p6-7): 5.6 Designing Against and Adversary
242 (p6-8): Exercises
246 (p6-9): Notes and References
249 (p7): 6 Dynamic Sets and Searching
250 (p7-2): 6.1 Introduction
250 (p7-3): 6.2 Array…