With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job at explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some maths background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked list to trees (including binary trees, red-black and B-trees), ...
Sound introduction to foundational algorithms, 2007-05-13
The algorithms, including the mathematical background and justification, are set out clearly. The comprehensive index makes this a useful reference. Online resources to support the book include a corrections page and an explanation of the "Professor's names" jokes scattered through the text. There is an instructor's manual but, given the widespread use of the book in formal training courses, it is not available to independent users of the book, whether students or practitioners.

The contents and index are detailed, the introductions at the beginning of each chapter are easy to read and understand - for those of us who don't appreciate awkward sentences interspersed with unnecessary jargon and equations, that will neither be remembered nor understood (and don't need to be). I have also found the summary boxes particularly useful when revising for exams or checking things i should know when doing questions.

Overall i was very impressed with this book, much less dry than most of the competition, and not something i will be selling before i finish my degree.