Ask HN: Recommendations for a book about algorithms and data structures?
Is there any book that acts as a reference book for algorithms and/or data structures that have the following:
* Explanation
* Code examples
* History (when/who first used it)
* Application examples
18 comments
[ 2.1 ms ] story [ 60.0 ms ] threadThe classic textbooks are:
If you're extremely serious about algorithms, you might wanna go directly with the bible: TAOCP[1].[1] http://www-cs-faculty.stanford.edu/~uno/taocp.html
http://www.amazon.co.uk/Art-Computer-Programming-Fundamental...
part 1 or is this:
http://www.amazon.co.uk/Computer-Programming-Fascicle-MMIX-M...
Fascicles is a new effort by Knuth and is more hardware oriented.
Algorithm Design [Kleinberg, Tardos] (2005)
It also contains instructive exercises and answers.
https://en.wikipedia.org/wiki/How_to_Solve_it_by_Computer
http://www.algorist.com/
It's under the "Develop a strong understanding of algorithms and data structures" part.
The former has the best exercises (borderline mathematical), but is lightest on implementation. The latter has the best introductory pedagogy and has implementation code, but is not what I would use if I want to grok algorithms deeply.
People keep recommending Cormen. He's the book you get AFTER you understand algorithms. Cormen reads more like a reference manual. Cormen can substitute in for Skiena in a pinch. Skiena sounds like the one you want most of all though.