[ins0]

One of my favorite sites that i usually share with my students is:

http://www.cs.usfca.edu/~galles/visualization/Algorithms.htm...

Many algorithms and nice visualizations.

[phlyingpenguin]

Thank you. I use the sorting-algorithms visualization and it is usually a great hook for getting students to grok the rest of the content. It'll be great to have more resources.

[epalmer]

Thank you. When I was in college (many decades ago) I just though insertion sorting was it. Then bubble sorts. I did not expect the mental flip I did when we starting researching quick sorts. That changed my perspective on obvious but incorrect assumptions forever.

These visualizers I think can get you there even faster. I just love this stuff.

[drostie]

I found out that my usual way of sorting cards as a kid was a variant of quicksort.

This is to sort the cards first into black v. red, then the black cards into spades v. clubs, then the spades into high v. low, then finally sort the low ones by inspection (a kind of insertion sort I guess), sort the high ones by inspection, sort the clubs similarly, etc.

Like most quicksorts, this definitely uses O(log(n)) space as you have a deck of reds, a deck of clubs, and a deck of high spades while you're handling the low spades...

[federicoponzi]

Thanks, really interesting!

[spike021]

Agreed. This was a nice resource to use while I was taking a data structures and algorithms class.