See sort algorithm. Quick Sorting a List This quick sort uses randomly chosen pivots (in red) to keep dividing the list into two until there is only one item on each side of the pivot left.

The algorithms on display in this video include selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), std::sort (intro sort), std::stable_sort ...

If you’re under the impression that something as simple as sorting numbers is dull, think again. This visualization lets you see and hear fifteen different algorithms sift their way through a ...