Saturday, January 18, 2014

Geek: interesting and useful data structures...

Geek: interesting and useful data structures ... that aren't so well known.  This was fascinating for me to go through, for two reasons.  First, most of these weren't known to me at all, or were things I'd run into only in passing before (example: Cuckoo hash tables).  Others, though, were very well known to me – but really, only because I happen to have worked in areas that used them (examples: Huffman trees and Bloom filters).  I imagine that almost anyone who's worked in software for a number of years would have the same results.  One might actually be able to use this as a crude metric of overall software development experience (or age :).  In any case, it was an odd feeling to see a bunch of things I was familiar with called “lesser known”!

No comments:

Post a Comment