quicksort
The QuickSort visualization was one of our first attempts at building a region module to drive the behavior of objects. Basically, we create some number of colored objects and apply a quick sort algorithm using the hue of the object as its value. This simple visualization pointed out several things: single pivot selection results in sorts that are much closer to O(n^2) so we added a sample set to determine the pivot point; and this algorithm begs for parallel processing.
|
Full size:
256x256
|
