000			02031nam a2200205 a 4500
020			_a8120340078
082			_a005.1 _bCOR
100	1		_aCormen.
245	1	0	_aIntroduction to Algorithms
250			_a3rd Ed.
260			_aNew Delhi _bPHI Learning, _c2009
300			_axix, 1292 p. _c17x23.5 cm
500			_aThis internationally acclaimed textbook provides a comprehensive introduction to the modern study of computer algorithms. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and presents an algorithm, a design technique, an application area, or a related topic. The algorithms are described and designed in a manner 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 third edition has been revised and updated throughout. It includes two completely new chapters, on Van Emde Boas trees and Multithreaded algorithms, and substantial additions to the chapter on recurrences (now called “Divide and Conquer”). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edgebased flow in the material on flow networks. Many new exercises and problems have been added in this edition. The text is intended primarily for students studying algorithms or data structures. As it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for selfstudy by technical professionals.
504			_aIncluding with reference and index
650			_aIntroduction to Algorithms, The Role of Algorithms in Computing, Growth of Functions, Divide and Conquer, Probabilistic Analysis and Randomized Algorithms, Sorting and Order Statistics, Data Structure, Advance design and Analysis Techniques.
700			_aLeiserson, Charles E.
700			_aRivest, Ronald L.
700			_aStein, Clifford
942			_cBK
999			_c18324 _d18324