This is the most readable, accurate, comprehensive, and voluminous textbook available today on the subject of algorithm design and analysis. The material is divided among 37 chapters organized in seven parts: Mathematical foundations, Sorting and order statistics, Data structures, Advanced design and analysis techniques, Advanced data structures, Graph algorithms, and Selected topics. The topics treated cover a wide range from the standard (e.g., sorting, searching, graph algorithms), to the modern (e.g., computational geometry, amortized analysis), to the advanced (e.g., number theory, parallel algorithms). The authors are to be commended for their clear and thorough exposition. And while the book's presentation style is quite traditional, its breadth of coverage puts it in a class by itself. Almost all of the most useful algorithms can be found in the book, making it a valuable reference for undergraduate and graduate students, as well as practitioners.
Reviewer: Akl, Selim G. [form MathSciNet]