000			01094nam a22001817a 4500
008			190225b xxu||||| |||| 00| 0 eng d
020			_a978-81-203-4007-7
082			_a005.1/COR/LEI
100			_aCORMEN THOMAS
245			_aINTRODUCTION TO ALGORITHMS
250			_a3rd ed
260			_aNEW DELHI _bPHI LEARNING PVT LTD _c2009
300			_axix, 1292
520			_aThis book on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely 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.
650			_aCOMPUTER PROGRAMMING, COMPUTER ALGORITHMS
700			_aLEISERSON CHARLES
942			_2ddc _cB
999			_c627264 _d627264