000 01865 am a22003134a 4500
008 130404s2005 us d g 000 0 eng d
020 _a9780262531962
020 _a0262531968
082 0 0 _a005.1
_2 22
_bCOR
100 1 _aCormen, Thomas H.
_933851
245 1 _aIntroduction to Algorithms
_b Second Edition
_c Thomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest.
250 _a2nd ed.
260 _aBoston, USA
_b McGraw-Hill Book
_c 2005.
300 _a1180 p.
_b ill.
_c 18 cm.
500 _aIncludes bibliographical referencese and index.
500 _aSixth Printing, 2005.
500 _a2001 print by the Massachusetts Institute of Technology.
520 2 _a 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.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.
650 1 0 _aMathematics
_x Computer assisted instruction.
_933852
650 1 0 _aComputer Softwar.
_933853
650 1 0 _aComputer science.
_933854
650 1 0 _aMathematicals models.
_933855
650 1 0 _aProgramming languages.
_933856
653 _bCS
700 1 _aLeiserson, Charles E.
_933857
700 1 _aRivest, Ronald L.
_933858
700 1 _aStein, Clifford.
_933859
942 _2ddc
_cBB
999 _c17584
_d17556