000			01843nam a2200217Ia 4500
005			20250129120142.0
008			240411s9999||||xx |||||||||||||| ||und||
020			_c350.00 _a978-0262032933
040			_aSCA
082			_a005.1 _bCOR
100			_aThomas H. Cormen
245		0	_aIntroduction to Algorithms
250			_a2nd. Edn.
260			_aNew Delhi _bPHI Learning _c2001
300			_a1180p.
500			_aThere are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained 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 first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
700			_a Charles E. Leiserson
700			_aRonald L. Rivest
700			_a Clifford Stein
942			_cBK
999			_c49048 _d49048