D3: Sort algorithm walkthroughs

Here are visualizations of common sorting algorithms. Use the comparisons counter and number of items to observe the performance of each randomized case. [Source repository]

Quicksort discussion

used by chrome.
source code link

Mergesort discussion

used by firefox and safari.
helpful: http://stackoverflow.com/questions/2967153/space-requirements-of-a-merge-sort
source code link

Selection sort discussion

http://stackoverflow.com/questions/15799034/insertion-sort-vs-selection-sort
finds upstram minimum and swaps with current.
source code link

Insertion sort discussion

how is this different from bubble and selection.
swap. highlight. fade.
source code link

Shellsort discussion

several ways to pick gap width, but dependence on input data makes gap selection trivial.
Insertion sort with gap of 1.
source code link

Bubble sort discussion

how is this different from insertion and selection sorts.
talk about turtles and rabbits, because search loops from beginning each time. Every number out of place means a new pass must be done.
source code link