This book covers all the details of any algorithm. Then, flip a few chapters in each section to gain a feel for the different groupings of algorithms. After reviewing it from a high level, it helps me understand the algorithm on a surface level.

It is rigorous yet approachable for anyone who likes a challenge. The mathematic is thorough and satisfying with complete proof of properties and theorems. Alot of examples and plus alot of math involved in this book.

The style of the book is dry and boring leaving the reader frustrated and unmotivated. The book seems used and has printing defects. The cover page also looks old.

The problems are horrible. The flow is horrible. Simply didn't meet my expectation.

There is zero information about merkle trees (hash trees), which were discovered in 1979. The drive consists of one or more platters, which rotate at a constant speed around a common spindle.

In spite of this terseness, the book takes an astonishing 1292 pages! All in all, an avoidable tome.

This book is responsible for an entire generation of programmers hating algorithms. The pseudocode has one-letter variable names that appear at times to be randomly generated. Add to that no official solutions manual available to students and long lis...  Read More