Description: There are books on algorithms that are rigorous but not complete and books that cover all the material yet are not rigorous. "Introduction to Algorithms combines both attributes in a comprehensive and fully understandable introduction to the study of algorithms that makes it suitable for use as a text, handbook or general reference.

"Introduction to Algorithms covers both traditional material and modern developments in the field: elementary data structures, sorting, graph algorithms and NP completeness are included along with modern material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number theoretic algorithms. Useful new techniques, such as probabilistic and amortized analysis are presented. The mathematical analyses, while rigorous, are carefully explained to make them more accessible to undergraduates.

Chapters progress section by section from elementary to advanced material. Each chapter is relatively self contained and can be used as a unit of self study. Algorithms are presented clearly in a "pseudocode" that is easily read by anyone familiar with Pascal, C, or Fortran. Numerous pertinent examples, illustrative figures, exercises, and case-study problems emphasize both engineering and mathematical aspects of algorithms.

The authors are members of the Department of Electrical Engineering and Computer Science and the Laboratory for Computer Science at MIT. Thomas H. Cormen has won awards for his technical presentations. Charles E. Leiserson is Associate Professor of Computer Science and Electrical Engineering, and Ronald L. Rivest is Professor of Computer Science and AssociateDirector of the Laboratory for Computer Science. "Introduction to Algorithms is included in the MIT Electrical Engineering and Computer Science series.

Please Wait