000			01425nam a22002897a 4500
999			_c791 _d791
003			OSt
005			20210205142741.0
008			180730b ||||| |||| 00| 0 eng d
020			_a9788120340077
040			_c0
082			_a004.421 COR
100			_aCormen, Thomas H
245			_aIntroduction to algorithms
250			_a3rd Ed.
260			_bCambridge, Mass. : _cMIT Press, PHI. _a©2009.
300			_axix, 1292 pages : _billustrations, _c24 cm.
505			_tI. Foundations. The role of algorithms in computing -- _tII. Sorting and order statistics. Heapsort -- _tIII. Data structures. Elementary data structures -- _tIV. Advanced design and analysis techniques. Dynamic programming -- _tV. Advanced data structures. B-trees -- _tVI. Graph algorithms. Elementary graph algorithms -- _tVII. Selected topics. Multithreaded algorithms -- _tVIII. Appendix: Mathematical background. Summations --
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			_aComputer programming
650			_aComputer algorithms
650			_aAlgorithms
650			_aData structures (Computer science)
700			_aRivest, Ronald L.
700			_aLeiserson, Charles Eric
700			_aStein, Clifford
942			_2ddc _cBK