فهرست مطالب

• Contents
• Preface
• Part I: Foundations
• Introduction
• 1 The Role of Algorithms in Computing
• 2 Getting Started
• 3 Characterizing Running Times
• 4 Divide-and-Conquer
• 5 Probabilistic Analysis and Randomized Algorithms
• Part II: Sorting and Order Statistics
• Introduction
• 6 Heapsort
• 7 Quicksort
• 8 Sorting in Linear Time
• 9 Medians and Order Statistics
• Part III: Data Structures
• Introduction
• 10 Elementary Data Structures
• 11 Hash Tables
• 12 Binary Search Trees
• 13 Red-Black Trees
• Part IV: Advanced Design and Analysis Techniques
• Introduction
• 14 Dynamic Programming
• 15 Greedy Algorithms
• 16 Amortized Analysis
• Part V: Advanced Data Structures
• Introduction
• 17 Augmenting Data Structures
• 18 B-Trees
• 19 Data Structures for Disjoint Sets
• Part VI: Graph Algorithms
• Introduction
• 20 Elementary Graph Algorithms
• 21 Minimum Spanning Trees
• 22 Single-Source Shortest Paths
• 23 All-Pairs Shortest Paths
• 24 Maximum Flow
• 25 Matchings in Bipartite Graphs
• Part VII: Selected Topics
• Introduction
• 26 Parallel Algorithms
• 27 Online Algorithms
• 28 Matrix Operations
• 29 Linear Programming
• 30 Polynomials and the FFT
• 31 Number-Theoretic Algorithms
• 32 String Matching
• 33 Machine-Learning Algorithms
• 34 NP-Completeness
• 35 Approximation Algorithms
• Part VIII: Appendix – Mathematical Background
• Introduction
• A Summations
• B Sets, Etc.
• C Counting and Probability
• D Matrices
• Bibliography
• Index