Selection sorts perform numerous comparisons, but fewer data movements than other methods. See sort algorithm. (2) A search for specific data starting at the beginning of a file or list.

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 ...

This visualization lets you see and hear fifteen different algorithms sift ... the featured sorting techniques are, in order of appearance: selection sort, insertion sort, quick sort, merge ...