Introduction to Algorithms

Cormen, Thomas H.

Introduction to Algorithms Second Edition Thomas H. Cormen ; Charles E. Leiserson ; Ronald L. Rivest. - 2nd ed. - Boston, USA McGraw-Hill Book 2005. - 1180 p. ill. 18 cm.

Includes bibliographical referencese and index. Sixth Printing, 2005. 2001 print by the Massachusetts Institute of Technology.

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.

9780262531962 0262531968


Mathematics -- Computer assisted instruction.
Computer Softwar.
Computer science.
Mathematicals models.
Programming languages.



005.1 / COR