02094cam a2200313 a 4500 2925650 20210414114154.0 890803s1990 maua b 001 0 eng 89013027 0262031418 0070131430 (McGrawHill) DLC DLC DLC QA76.6.C662 005.1 20 Cormen, Thomas H. Introduction to algorithms. / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. Cambridge, Mass. : MIT Press ; New York : McGraw-Hill, c1990. xvii, 1028 p. : ill. ; 26 cm. The MIT electrical engineering and computer science series Includes bibliographcal references (p. [987]-996) and index. 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. Computer programming. Computer algorithms. Leiserson, Charles Eric. Rivest, Ronald L. Algorithms. 7 cbc orignew 1 ocip 19 y-gencatlg lcc BK 2555 10055 0 0 lcc 0 0 WIUC-1 WIUC-1 REF 2012-11-21 0 QA76.6.C662 6230/12 2012-11-21 00:00:00 2012-11-21 BK