000			01804nam a22003497a 4500
001			22158200
003			IIITD
005			20240815020005.0
008			210730s2022 maua b 001 0 eng
010			_a 2021037260
020			_a9780262046305
040			_aDLC _beng _erda _cDLC _dDLC
042			_apcc
050	0	0	_aQA76.6 _b.C662 2022
082	0	0	_a005.1 _223 _bCOR-I
245	1	0	_aIntroduction to algorithms _cby Thomas H. Cormen ... [et al.]
250			_a4th ed.
260			_aCambridge : _bMIT Press, _c©2022
300			_axx, 1291 p. : _bcol. ill. ; _c24 cm
504			_aIncludes bibliographical references (pages [1225]-1250) and index.
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			_a"The leading introductory textbook and reference on algorithms"-- This 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 Eric
700	1		_aRivest, Ronald L.
700	1		_aStein, Clifford
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK _02
999			_c172221 _d172221