TY  - BOOK
AU  - Cormen,Thomas H.
AU  - Leiserson,Charles Eric
AU  - Rivest,Ronald L.
TI  - Introduction to algorithms
SN  - 0262031418
U1  - 005.1  
PY  - 1990///
CY  - Cambridge, Mass., New York
PB  - MIT Press, McGraw-Hill
KW  - Computer programming
KW  - Computer algorithms
N1  - Includes bibliographcal references (p. [987]-996) and index; The Role of Al^algorithms in Computing 5
1.1 Algorithms 5
1.2 Algorithms as a technology 
(letting Started 16

2.1 Insertion sort 16
2.2 Analysing algorithms 23
2.3 Designing algorithms 29
Growth of Functions ^3

3.1 Asymptotic notation 43
3.2 Standard notations and common functions
Divide-and-Conquer 65

4.1 The maximum-subarray problem 68
4.2 Strassen's algorithm for matrix multiplication 75
4.3 The substitution method for solving recurrences 83
4.4 The recursion-tree method for solving recurrences 88
4.5 The master method for solving recurrences 93
4.6 Proof of the master theorem 97
Probabilistic Analysis and Randomized Algorithms 114

5.1 The hiring problem 114
5.2 Indicator random variables JI8
5.3 Randomized algorithms 722
5.4 Probabilistic analysis and further uses of indicator random
ER  -