Really nice. The examples suggest to me that a lot of algorithms would be more accessible to people if they could be visually represented in some way. The timing is important -- the slowness of the bubble sort compared to the quickness of the quick sort gives one an immediate sense of why one would generally want the latter over the former.
I'm more interested in the visual aesthetic, but I've built a few sculptures[1] visualizing algorithms. It's something I'm hoping to expand on when I have more time and resources. I'd write a bit more about them, but I'm on my phone getting ready for work.
Often it has to do with speed of implementation and a data set that is small enough for negligible difference. There is also an issue of whether the algorithm keeps duplicate ordering intact.
I'm seeing waaaay too much stuff happen all at once for quicksort. Frankly, most visualizations give you an inkling as to the logic behind an algorithm, but quicksort just sort of pops the field into the correct order in a blur.
Another classic sorting algorithm to visualize is heapsort.
Interestingly, I just migrated my Sorting Visualizer off of GAE this weekend. Its kind of similar - more customizable, much less attractive: http://aarondufour.com/
This is excellent and a great teaching tool. I tried putting something like this together a while back as a Java applet for one of my classes but couldn't get the color ordering function to work correctly. Did you use HSB?
[+] [-] allochthon|12 years ago|reply
[+] [-] wollw|12 years ago|reply
[1] http://wollw.github.io/Cellular-Polymaton
http://m.youtube.com/watch?v=N_smOznDDJs
http://m.youtube.com/watch?v=vbtvAQLDcrs
[+] [-] lsjroberts|12 years ago|reply
[+] [-] izzydata|12 years ago|reply
[+] [-] bpierre|12 years ago|reply
[+] [-] lolo_|12 years ago|reply
[+] [-] GhotiFish|12 years ago|reply
Another classic sorting algorithm to visualize is heapsort.
[+] [-] lolo_|12 years ago|reply
I know that isn't too obvious, but this was something of a quick hack :)
[+] [-] saw-lau|12 years ago|reply
[+] [-] lolo_|12 years ago|reply
Full source code is available at https://github.com/lorenzo-stoakes/Rainbow-Sort, no guarantees as to quality... all (4 :P) algorithms are there.
[+] [-] mistercow|12 years ago|reply
[+] [-] lolo_|12 years ago|reply
This was just a quick hack a year or so ago, am open to enhancing it though - feel free to post any suggestions over at https://github.com/lorenzo-stoakes/Rainbow-Sort/issues :)
[+] [-] thedufer|12 years ago|reply
[+] [-] primitivesuave|12 years ago|reply
[+] [-] lolo_|12 years ago|reply
Yeah indeed, well, hsl with varying hue and set saturation + luminescence - see https://github.com/lorenzo-stoakes/Rainbow-Sort/blob/master/....
I experimented with RGB and it really didn't work, HS(B/L) work a million times better. Took a bit of trial and error!
[+] [-] y0ghur7_xxx|12 years ago|reply
not as nice, but shows different algorithms and their speed
[+] [-] greggman|12 years ago|reply
http://greggman.github.io/doodles/sort.html
click one for a larger version
PS: My method of cycle counting may not make any sense.
See https://github.com/greggman/doodles for details
[+] [-] joshu|12 years ago|reply
I like Aldo's visualizations a bit better: http://corte.si/%2Fposts/code/sortvis-fruitsalad/index.html
[+] [-] mh_yam|12 years ago|reply
[+] [-] reg29|12 years ago|reply
[+] [-] unknown|12 years ago|reply
[deleted]
[+] [-] TophWells|12 years ago|reply
Only more colourful and interactive.
[+] [-] muffkin|12 years ago|reply
[+] [-] lolo_|12 years ago|reply
[+] [-] saxaholic|12 years ago|reply
[+] [-] izzydata|12 years ago|reply
[+] [-] lolo_|12 years ago|reply
[+] [-] pekk|12 years ago|reply
Why do we educate students to re-implement sorting again?
[+] [-] dpe82|12 years ago|reply