Ralph Lagner's fascinating TED talk on reverse-engineering the Stuxnet worm. This is the best presentation on cyber-terrorism/security I've seen so far.
The bubble sort algorithm, illustrated as a Hungarian line dance. (via flowingdata) Fun, but a little long. What sort of dance could illustrate a heap sort?
A quick (4min) TED talk on Google's driverless cars. Nifty.
1 comment:
The problem with visualizing heap sort is that it's easiest understood as a tree, not a flat array. That being said, you could probably use any kind of dance in a line that pulls from non-uniform position. (See the Shell-Sort example: http://www.youtube.com/watch?v=CmPA7zE8mx0)
Post a Comment