Introduction
Mathematical Foundations
- Growth of Functions
- Summations
- Recurrences
- Sets, etc.
- Counting and Probability
Sorting and Order Statistics
- Heapsort
- Quicksort
- Sorting in Linear Time
- Medians and Order Statistics
Data Structures
- Elementary Data Structures
- Hash Tables
- Binary Search Trees
- Red-Black Trees
- Augmenting Data Structures
Advanced Design and Analysis Techniques
- Dynamic Programming
- Greedy Algorithms
- Amortized Analysis
Advanced Data Structures
- B-Trees
- Binomial Heaps
- Fibonacci Heaps
- Data Structures for Disjoint Sets
Graph Algorithms
- Elementary Graph Algorithms
- Minimum Spanning Trees
- Single-Source Shortest Paths
- All-Pairs Shortest Paths
- Maximum Flow
Selected Topics
- Sorting Networks
- Arithmetic Circuits
- Algorithms for Parallel Computers
- Matrix Operations
- Polynomials and the FFT
- Number-Theoretic Algorithms
- String Matching
- Computational Geometry
- NP-Completeness
- Approximation Algorithms
Introduction to Algorithms.
Cormen TH; Leiserson CE; Rivest RL, Stein C.
staff.ustc.edu.cn .
Jul 31, 2009.