000			01968nam a2200229Ia 4500
003			NULRC
005			20250520103015.0
008			250520s9999 xx 000 0 und d
020			_a9780070131439
040			_cNULRC
050			_aQA 76.6 .C67 1990
100			_aCormen, Thomas H. _eauthor
245		0	_aIntroduction to algorithms / _cThomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest
260			_aNew York : _bMcGraw Hill Education, _cc1990
300			_axvii, 1028 pages : _billustrations ; _c26 cm.
504			_aIncludes 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			_aThis book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic.
650			_aALGORITHMES
700			_aLeiserson, Charles E. ;Rivest, Ronald L. _eco-author;co-author
942			_2lcc _cBK
999			_c21204 _d21204