Cormen, Thomas H. <br/><br/>
Introduction to algorithms/ 
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. 
 - Cambridge, Mass. :  New York :  MIT Press ;  McGraw-Hill,  1990. 
 - xvii, 1028 p. :  ill. ;  26 cm. 
 - The MIT electrical engineering and computer science series .
<br/><br/>Includes bibliographcal references (p. [987]-996) and index. 
<br/><br/>The Role of Al^algorithms in Computing 5<br/>1.1 Algorithms 5<br/>1.2 Algorithms as a technology <br/>(letting Started 16<br/><br/>2.1 Insertion sort 16<br/>2.2 Analysing algorithms 23<br/>2.3 Designing algorithms 29<br/>Growth of Functions ^3<br/><br/>3.1 Asymptotic notation 43<br/>3.2 Standard notations and common functions<br/>Divide-and-Conquer 65<br/><br/>4.1 The maximum-subarray problem 68<br/>4.2 Strassen's algorithm for matrix multiplication 75<br/>4.3 The substitution method for solving recurrences 83<br/>4.4 The recursion-tree method for solving recurrences 88<br/>4.5 The master method for solving recurrences 93<br/>4.6 Proof of the master theorem 97<br/>Probabilistic Analysis and Randomized Algorithms 114<br/><br/>5.1 The hiring problem 114<br/>5.2 Indicator random variables JI8<br/>5.3 Randomized algorithms 722<br/>5.4 Probabilistic analysis and further uses of indicator random 
<br/><br/><label>ISBN: </label>0262031418 0070131430 (McGrawHill) 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer programming.<br/>Computer algorithms.
<br/><br/><label>Dewey Class. No.: </label>005.1   / COR/I