000			01078cam a2200301 a 4500
999			_c163565 _d163565
020			_a0262031418
020			_a0070131430 (McGrawHill)
040			_cCUS
082	0	0	_a005.1 _bCOR/I
100	1		_aCormen, Thomas H.
245	1	0	_aIntroduction to algorithms/ _cThomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
260			_aCambridge, Mass. : _bMIT Press ; _aNew York : _bMcGraw-Hill, _c1990.
300			_axvii, 1028 p. : _bill. ; _c26 cm.
440		4	_aThe MIT electrical engineering and computer science series
504			_aIncludes bibliographcal references (p. [987]-996) and index.
505			_aThe 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
650		0	_aComputer programming.
650		0	_aComputer algorithms.
700	1		_aLeiserson, Charles Eric.
700	1		_aRivest, Ronald L.
942			_cWB16