000			02211cam a2200277 a 4500
020			_a9780262033848 (hardcover : alk. paper)
020			_a0262033844 (hardcover : alk. paper)
020			_a9788120340077
020			_a0262533057 (pbk. : alk. paper)
082	0	0	_a005.1 _bINT
245	0	0	_aIntroduction to algorithms /
250			_a3rd ed.
260			_aCambridge, Mass. : _bMIT Press, _cc2009.
260			_aNew Delhi : _bPHI Learning, _c2009
300			_axix, 1292 p. : _bill. ;
500			_aIncludes index
505			_aI. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices.
520			_aThis edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks
650		0	_aComputer programming.
650		0	_aComputer algorithms.
700	1		_aCormen, Thomas H.
700	1		_aLeiserson, Charles E.
700	1		_aRivest, Ronald L.
700	1		_aStein, Clifford
942			_cREF
999			_c44121 _d44121