Distribution and Integer Sorting Algorithms

Sorting algorithms that avoid pairwise comparison by using the keys themselves, such as radix sort, counting sort, bucket sort and flashsort. An algorithm belongs here when its cited article calls it a non-comparative, distribution or integer sorting algorithm. Because they exploit the form of the keys, they can run in linear time on suitable data. It excludes comparison sorts, which sit in their own group. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.