I know the basic search and sort stuff and basic data structures, mini-max and A* although not in a mathematically rigorous way. I am yet to implement any graph algorithms, path finding (besides A*) and other game theory stuff. I'm also blissfully unaware of a lot of things but would especially like to learn proper mathematically sound analysis of algorithms. Also I like math not code. Between the two I prefer a book with sound theory rather then a book with Python examples as I couldn't implement those myself.
Given all this what books would you suggest I pick up? Also, if you think I left out some important aspects of algorithm design, analysis and implementation I'd like to know.
>>5
If you mean Algorithms by Robert Sedgewick and Kevin Wayne, it's in my browsing history which means it must have been posted on /prog/ at some point, and therefore be a good book.
That's the one. It's good but definitely not the overly comprehensive textbook OP is looking for.
Name:
Anonymous2012-11-09 2:31
>>4
CLRS is mathematically rigorous, doesn't concentrate on implementation and is motherfucking comprehensive, and I know you haven't even touched the book so don't ``lolno'' me.
Name:
Anonymous2012-11-09 2:39
There is also ``The Algorithms Design Manual'' by Skiena, but OP sounds like a faggot who listened to /prague/'s words and read AIMA without sufficient maturity in fundamental CS.
Fundamental: ``The Practice of Programming'' by Rob Pike and Brian Kernighan
Further reading: ``Art of Computer Programming, Volume 1: Fundamental Algorithms'' by Donald E. Knuth
Name:
2012-11-10 6:34
Name:
Anonymous2012-11-10 18:39
>mathematically rigorous
no
>comprehensive
no
>you haven't touched it
i bought the damned book