Introduction to algorithms. /
Cormen, Thomas H.
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 .
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.
0262031418 0070131430 (McGrawHill)
89013027
Computer programming.
Computer algorithms.
QA76.6.C662
005.1
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 .
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.
0262031418 0070131430 (McGrawHill)
89013027
Computer programming.
Computer algorithms.
QA76.6.C662
005.1