Some books on algorithms are rigorous but incomplete; others cover masses of materialbut lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The bookcovers a broad range of algorithms in depth, yet makes their design and analysis accessible to alllevels of readers. Each chapter is relatively self-contained and can be used as a unit of study. Thealgorithms are described in English and in a pseudocode designed to be readable by anyone who hasdone a little programming. The explanations have been kept elementary without sacrificing depth ofcoverage or mathematical rigor.The first edition became a widely used text in universities worldwideas well as the standard reference for professionals. The second edition featured new chapters on therole of algorithms, probabilistic analysis and randomized algorithms, and linear programming. Thethird edition has been revised and updated throughout. It includes two completely new chapters, onvan Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence(now called "Divide-and-Conquer"), and an appendix on matrices. It features improvedtreatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in thematerial on flow networks. Many new exercises and problems have been added for this edition. As ofthe third edition, this textbook is published exclusively by the MIT Press.
Thehardcover edition does not include a dust jacket.