000			02213cam a2200385 a 4500
001			u8948
003			SA-PMU
005			20210418124031.0
008			010405s2001 mau b 001 0 eng
010			_a 2001031277
040			_aDLC _beng _cDLC _dC#P _dUKM _dLVB _dBAKER _dNLGGC _dBTCTA _dYDXCP _dCDX _dTXJ _dOLP _dUAB _dHEBIS _dDEBBG _dMR0 _dTULIB _dOCLCF
020			_a0262032937 (hbk. : alk. paper)
020			_a9780262032933 (hbk. : alk. paper)
020			_a0070131511 (McGraw-Hill)
020			_a9780070131514 (McGraw-Hill)
020			_a0262531968 (pbk.)
020			_a9780262531962 (pbk.)
035			_a(OCoLC)46792720 _z(OCoLC)55947682
050	0	0	_aQA76.6 _b.C662 2001
082	0	0	_a005.1 _221
245	0	0	_aIntroduction to algorithms / _cThomas H. Cormen ... [et al.].
246	3	0	_aAlgorithms
250			_a2nd ed.
260			_aCambridge, Mass. : _bMIT Press, _cc2001.
300			_axxi, 1180 p. ; _c24 cm.
500			_aRev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
504			_aIncludes bibliographical references (p. [1127]-1130) and index.
505	0		_aThe 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.
650		0	_aComputer programming.
650		0	_aComputer algorithms.
700	1		_aCormen, Thomas H.
942			_cBOOK
994			_aZ0 _bSUPMU
596			_a1 2
999			_c5872 _d5872