This book is tiny and portable yet every major algorithm is covered. Basics, like mathematical
induction are reviewed and illustrated with relevant examples.
One of the ways that Udi Manber packs so much information into such a small package is by
keeping verbosity to a minimum. In his proofs, only the most complicated steps are justified or
explained. As a result the reader may find herself spending time justifying steps in the proofs
that are unrelated to the problem at hand. I did not mind doing this; others may. Regardless, the
persistent reader will find that within the pages of this book lies all of the information required to
understand all of the algorithms covered (and of course, it never hurts to keep a notebook, pencil
and several erasers handy).
| It's a very perfect book to become familiar with main methods of producing effective algorithms. |
Most books I have read on the subject seem to be simply a collection of algorithmic tricks and
techniques.