000			01898cam a22003614i 4500
005			20260114233634.0
008			130404s2005 xxud g 000 0 eng d
020			_a9780262531962 _c120.00E.P
040			_aMPL _cMPL _erda
041	0		_aara
082	0	0	_a005.1 _221
100	1		_aCormen, Thomas H
245	1	0	_aIntroduction to Algorithms _bSecond Edition _cThomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest
250			_a2nd ed
264		0	_aBoston, USA _bMcGraw-Hill Book _c2005
300			_a1180 pages _billustrations _c18 سم
336			_aنص
337			_aبدون وسيط
338			_aكتاب
500			_a2001 print by the Massachusetts Institute of Technology
500			_aIncludes bibliographical referencese and index
500			_aSixth Printing, 2005
520	2		_aIntroduction 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.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming
596			_a1 12
650		0	_aComputer Softwar
650		0	_aComputer science
650		0	_aMathematicals models
650		0	_aMathematics _xComputer assisted instruction
650		0	_aProgramming languages
700	1		_aLeiserson, Charles E
700	1		_aRivest, Ronald L
700	1		_aStein, Clifford
999			_c10409 _d10409