Introduction to Algorithms

Front Cover
Thomas H. Cormen
교보문고, 2001 - Computers - 1180 pages
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers.

PLEASE NOTE: This is the international student paperback edition of this book. The MIT Press does not have sales rights for this paperback edition in the US and Canada. Customers in the US and Canada must order the hardcover edition.

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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 the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

What people are saying - Write a review

LibraryThing Review

User Review  - IvanIdris - LibraryThing

This book is like an encyclopedia of algorithms. The algorithms are presented with pseudo code so it doesn’t matter what your favorite programming language is. A very rigorous mathematical approach is used for the analysis of for instance performance. Read full review

Other editions - View all

About the author (2001)

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms.

Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.

Bibliographic information