The site is not finished yet, but each algorithm is interesting on its own.

Look at my submission history:

https://news.ycombinator.com/submitted?id=bugfix-66

Really remarkable tiny algorithms like Martin Rem's almost-forgotten Union-Find, the tiny bitwise linear string search from approximate-grep, hash treaps, Quicksearch (the fastest sublinear string search in practice), a simple state-of-the-art arithmetic coder/decoder, space-filling curves, the Shortest Path Faster algorithm, etc.

Next week I'll publish a fantastic generalization of bytewise integer encoding (like Varint or git's VLQ but better).

I'll do a Show HN for the site itself some time next year.