000			01760nam a22002777a 4500
005			20260916155213.0
008			260916s2022 |||||||| |||| 00| 0 eng d
020			_a9780262046305
040			_cPK-LaUMT
082			_a005.1 _bINT-
245	0	0	_aIntroduction to algorithms / _cThomas H. Cormen . . . [et al.]
250			_a4th ed.
260			_aCambridge : _bThe MIT Press, _c2022
300			_axx, 1291 p.
500			_aIncludes bibliographical references and index.
520			_aA comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays.
546			_aEng
650			_aAlgorithms
650			_aComputer algorithms _93596
650			_aComputer programming
700	1		_aCormen, Thomas H. _915545
700	1		_aLeiserson, Charles Eric _915546
700	1		_aRivest, Ronald L. _915547
700	1		_aStein, Clifford _915548
942			_cBK
999			_c142531 _d142531