The algorithms included here cover a broad range of fundamental and more advanced sorting, searching, string-processing, geometric, graph, and mathematical algorithms. Readers will see how key algorithms can be implemented, run, debugged, and used in real applications--plus why some algorithms are to be preferred over others.
I read most of this again recently to refresh my knowledge of basic algorithms while interviewing for a new job. It has good coverage of many areas of computer science. I felt the use of C++ was a bit superfluous as most of the algorithms could have been coded just as well in, say, C. I was also slightly surprised that the code presented was already highly optimized, with tricky edge conditions exploited in non-obvious ways, rather than presenting less optimized but easier to follow code.
Overall, though, it's a useful, well written reference work, if slightly dated now.
This is a wonderful programming book explaining various algorithms with sample code. In this 1992 release of the book there were several code examples that were not correct; however, this still did not detract from the usefulness of the book. Thus, I still give it a good rating. As a fellow computer scientist, it was well organized, I learned much from the topics, and I enjoyed the reading. The challenge of attempting to understand the algorithms, and fixing some of them, was well worth it.