I have mixed feelings about The Algorithm Design Manual. It seems like the perfect CS textbook for a programmer that hasn’t had a classical CS training, if that makes any sense. The first major chunk of the book covers basic searching, sorting, and data structures, and then proceeds to touch on computational geometry and graph theory.
The second chunk is then a catalog of stock problems, and guidance as to the best way to solve them. Usually this is a pretty brief discussion, and offers pointers to what texts/papers to read and what libraries to download that can solve a problem better than the reader can.
Why I have mixed feelings is that any good algorithms and data structures textbook covers 90% of the material within, and does so in a usable detail, rather than at a gloss-over level. Probably the most interesting aspect for me was the discussion of tries and suffix trees, an are that wasn’t given much attention at UIUC.
Like I say, worth it if you’re writing code and not a CS major. Probably not worth the time if you’ve read a decent book on algorithms or two. 6/10.