000			02449nam a2200229 a 4500
020			_a9788120313538
020			_a8120313534
082			_a005.1 _bCOR
100			_aCormen, Thomas H. :
245			_aIntroduction to algorithms
260			_aCambridge, Massachusetts : _bMIT Press, _c1990.
300			_axvii, 1028 p. : _billustrations ;
500			_aIncluded Index.
505			_aGrowth of functions -- Summations -- Recurrences -- Sets, etc. -- Counting and probability -- 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 -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.
520			_aThere are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference. Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will be accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics. Each chapter is relatively self-contained and can be used as a unit of study. Algorithms are presented in a pseudocode that can be easily read by anyone familiar with Fortran, C, or Pascal. Numerous pertinent examples, figures, exercises, and case-study problems emphasize both engineering and mathematical aspects of the subject.
650			_aComputer programming.
650			_aComputer algorithms.
650			_aAlgorithms.
700			_aLeiserson, Charles E. :
700			_aRivest, Ronald L. :
942			_cREF
999			_c11147 _d11147