Saturday, December 17, 2011

Quick Sort : With Hungarian Dance

This is a great visualization of the Quick Sort algorithm.

Most programmers could write a bubble sort. But I wonder how many could write an insertion sort, quick sort, or heap sort, without benefit of Wikipedia, or StackOverflow, or google, or any internet "crutches". If you understand it well enough to draw it out visually, you can write it.

Next time you have a hard programming problem, I recommend you step away from the keyboard, and try a pencil and paper. And if that doesn't work..... Maybe do a little dance.

1 comment:

  1. cool, but it will be more fun if we can demonstrate Heapify with this dance...