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,  c1990. 
 - 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/>Contents: Introduction -- Mathematical foundations: Introduction: Growth of functions -- Summations -- Recurrences -- Sets, etc -- Counting and probability -- Sorting and order statistics: Introduction: Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Data structures: Introduction: Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Advanced design and analysis techniques: Introduction:Dynamic programming -- Greedy algorithm -- Amortized analysis -- Adavnced data structures: Introduction: B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoints sets -- Graph algorithm: Introduction: Elementary graph algorithm -- Minimum spannin trees -- Single-source shortest paths -- Maximum flow -- Selected topics: Introduction: Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the EFT -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms. 
<br/><br/><label>ISBN: </label>0262031418 0070131430 (McGrawHill) 
<br/><br/><label>LCCN: </label>89013027  
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer programming.<br/>Computer algorithms.
<br/><br/><label>LC Class. No.: </label>QA76.6.C662 
<br/><br/><label>Dewey Class. No.: </label>005.1