Introduction to algorithms / 
 Algorithms 
Thomas H. Cormen ... [et al.]. 
 - 2nd ed. 
 - Cambridge, Mass. :  MIT Press,  c2001. 
 - xxi, 1180 p. ;  24 cm. 
<br/><br/> Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990. 
<br/><br/>Includes bibliographical references (p. [1127]-1130) and index. 
<br/><br/>The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algortihms -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash Tables -- Binary Search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy Algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algortihsm -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability. 
<br/><br/><label>ISBN: </label>0262032937 (hbk. : alk. paper) 9780262032933 (hbk. : alk. paper) 0070131511 (McGraw-Hill) 9780070131514 (McGraw-Hill) 0262531968 (pbk.) 9780262531962 (pbk.) 
<br/><br/><label>LCCN: </label>2001031277 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer programming.<br/>Computer algorithms.
<br/><br/><label>LC Class. No.: </label>QA76.6  / .C662 2001 
<br/><br/><label>Dewey Class. No.: </label>005.1