I really love this! I saw your github repo "forest" as well. I wish there were more bundled resources or code examples like this. Not because I think everything should be out there in the open, free to get. But more as a way of retrieving examples about (maybe complex) algorithms.
Traditional books fail me in most of the cases as I want modern techniques combined with (maybe) "old" algorithms.
I would love it if people could show me modern examples and implementations (and reasoning) about let's say things from clrs for example:
- trees (red/black, splay, B, quadtrees, k-trees
- dynamic programming
- hasing (extendible, linear)
- pairing heaps, binomial queues
- shortest distances with dijkstra, johnson, bellman-ford
- finite state machines etc
- string algorithms like boyer-moore, knuth-morris-pratt
- (...)
FYI: I had no account prior to this comment, created one just for you ;) Keep up the good work OP!
Traditional books fail me in most of the cases as I want modern techniques combined with (maybe) "old" algorithms.
I would love it if people could show me modern examples and implementations (and reasoning) about let's say things from clrs for example:
- trees (red/black, splay, B, quadtrees, k-trees
- dynamic programming
- hasing (extendible, linear)
- pairing heaps, binomial queues
- shortest distances with dijkstra, johnson, bellman-ford
- finite state machines etc
- string algorithms like boyer-moore, knuth-morris-pratt
- (...)
FYI: I had no account prior to this comment, created one just for you ;) Keep up the good work OP!