Another classic sorting algorithm to visualize is heapsort.
Another classic sorting algorithm to visualize is heapsort.
I know that isn't too obvious, but this was something of a quick hack :)
One way to do it might be to allow the user to set the timeout in your defer function.
Setting the timeout to 1 second lets the user observe each run of your algorithms. You can see the partitioning behaviour a bit better like that.
Side note: this code is pretty. I should learn coffeescript.
Thanks for your kind comment on the code qual :) personally I only see the faults, for one I am sure I could improve perf... year-old code is often that way however! :)
My estimation is that you need to refactor the algorithms such that they hold their state inside a closure, and break after a set number of swaps. Say every 300 swaps they break and the canvas updates. This kind of background processing is such a pain in javascript.
the statement is true and informative: https://github.com/polarmobile/coffeescript-style-guide#tabs...
to someone who was just learning about coffeescript.