There are books on algorithms that are rigorous but not complete and
books that cover masses of material but are not rigorous.
Introduction to Algorithms combines the attributes of
comprehensiveness and comprehensibility. It will be equally useful as a
text, a handbook, and a general reference.
Introduction to Algorithms covers both classical material and
such modern developments as amortized analysis and parallel algorithms.
The mathematical exposition, while rigorous, is carefully detailed so
that it will be accessible to all levels of readers. Chapters are
organized so that they start with elementary material and progress to
more advanced topics.
Each chapter is relatively self-contained and can be used as a unit of
study. Algorithms are presented in a pseudocode that can be easily read
by anyone familiar with Fortran, C, or Pascal. Numerous pertinent
examples, figures, exercises, and case-study problems emphasize both
engineering and mathematical aspects of the subject.
Thomas H. Cormen is Assistant Professor in the Department of Computer
Science at Dartmouth College. Charles E. Leiserson is Professor and head
of the Supercomputing Technologies Group at the Laboratory for Computer
Science at MIT. Ronald L. Rivest is the Webster Professor of Electrical
Engineering and Computer Science in the Department of Electrical
Engineering and Computer Science and Associate Director of the
Laboratory for Computer Science at MIT.