000			02560cam a2200277 a 4500
005			20260318113438.0
008			890803s1990 maua b 001 0 eng
010			_a 89013027
020			_a9780262046305 _c13,680.00
040			_aS.X.U.K
041			_aEnglish
082	0	0	_aR 005.13 INT.Ed4
245	1	0	_aIntroduction to algorithms / _cThomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
250			_a4th ed.
260			_aCambridge, Mass. : _bMIT Press ; _aNew York : _bMcGraw-Hill, _cc1990.
300			_axvii, 1028 p. : _bill. ; _c26 cm.
440		4	_aThe MIT electrical engineering and computer science series
500			_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. Each chapter is relatively self-contained, presenting an algorithm, a design technique, an application area, or a related topic, and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The fourth edition has 140 new exercises and 22 new problems, and color has been added to improve visual presentations. The writing has been revised throughout, and made clearer, more personal, and gender neutral. The book's website offers supplemental material.
650		0	_aComputer programming.
650		0	_aComputer algorithms.
700	1		_aLeiserson, Charles Eric. _4auth.
700	1		_aRivest, Ronald L. _4auth.
700	1		_aCoremen, Thomas H. _4auth.
700	1		_aStein, Clifford _4auth.
942			_cB.TECH REF
999			_c14570 _d14570