来自"NOCOW"

《算法导论》（Introduction to Algorithms)
由Thomas H. Cormen,Charles E.Leiserson,Ronald L.Rivest,Clifford Stein编写的一本介绍、分析当代计算机算法的图书。有时也用四位作者的名字首字母组成的(CLRS)代表此书。

《算法导论》的内容:

I	Foundations	
1	The Role of Algorithms in Computing
2	Getting Started
3	Growth of Functions
4	Recurrences
5	Probabilistic Analysis and Randomized Algorithms

II	Sorting and Order Statistics	
6	Heapsort
7	Quicksort
8	Sorting in Linear Time
9	Medians and Order Statistics

III	Data Structures	
10	Elementary Data Structures
11	Hash Tables
12	Binary Search Trees
13	Red-Black Trees
14	Augmenting Data Structures

IV	Advanced Design and Analysis Techniques	
15	Dynamic Programming
16	Greedy Algorithms
17	Amortized Analysis

V	Advanced Data Structures	
18	B-Trees
19	Binomial Heaps
20	Fibonacci Heaps
21	Data Structures for Disjoint Sets

VI	Graph Algorithms	
22	Elementary Graph Algorithms
23	Minimum Spanning Trees
24	Single-Source Shortest Paths
25	All-Pairs Shortest Paths
26	Maximum Flow

VII	Selected Topics	
27	Sorting Networks
28	Matrix Operations
29	Linear Programming
30	Polynomials and the FFT
31	Number-Theoretic Algorithms
32	String Matching
33	Computational Geometry
34	NP-Completeness
35	Approximation Algorithms

VIII	Appendix: Mathematical Background	
A	Summations
B	Sets, Etc.
C	Counting and Probability