The Archive of Interesting Code

Shameless plug : I have a few of these ported to Python as well - <a href="https://github.com/prakhar1989/Algorithms" rel="nofollow">https://github.com/prakhar1989/Algorithms</a>

Um, pick me too! Persistent Red-Black Tree <a href="http://wiki.edinburghhacklab.com/persistentredblacktreeset" rel="nofollow">http://wiki.edinburghhacklab.com/persistentredblacktreeset</a>

Under what license may I reuse those snippets -- or are they too short to provoke legal issues anyways?

nice collection of things to study in one place. Any other similar..?

Nice and simple; I like it! Also, you just made every introductory CS teacher cringe, unless they import all of these into their cheating detection system.

I was so happy to see the in-place merge algorithm!<p>Does anyone know if there is an implementation of the (supposedly) faster version, which was published in this later paper?<p><a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.2842" rel="nofollow">http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134....</a>

Lots of really interesting things here. The most valuable is definitely having some reference implementations.

I am building a Scala one here: <a href="https://github.com/pathikrit/scalgos" rel="nofollow">https://github.com/pathikrit/scalgos</a>

Bidirectional Map can be implemented in less than 20 lines (put, get, remove).

Fantastic list. A great way to supplement the theory from CLRS, etc.

Some are interesting, but there's lots of mundane and generally boring stuff too, e.g. [1]<p>[1] <a href="http://www.keithschwarz.com/interesting/code/?dir=argmax" rel="nofollow">http://www.keithschwarz.com/interesting/code/?dir=argmax</a>