Editing Bucket sort (section)

==Comparison with other sorting algorithms==

Bucket sort can be seen as a generalization of [[counting sort]]; in fact, if each bucket has size 1 then bucket sort degenerates to counting sort. The variable bucket size of bucket sort allows it to use O(''n'') memory instead of O(''M'') memory, where ''M'' is the number of distinct values; in exchange, it gives up counting sort's O(''n'' + ''M'') worst-case behavior.

Bucket sort with two buckets is effectively a version of [[quicksort]] where the pivot value is always selected to be the middle value of the value range. While this choice is effective for uniformly distributed inputs, other means of choosing the pivot in quicksort such as randomly selected pivots make it more resistant to clustering in the input distribution.

The ''n''-way [[mergesort]] algorithm also begins by distributing the list into ''n'' sublists and sorting each one; however, the sublists created by mergesort have overlapping value ranges and so cannot be recombined by simple concatenation as in bucket sort. Instead, they must be interleaved by a merge algorithm. However, this added expense is counterbalanced by the simpler scatter phase and the ability to ensure that each sublist is the same size, providing a good worst-case time bound.

Top-down [[radix sort]] can be seen as a special case of bucket sort where both the range of values and the number of buckets is constrained to be a power of two. Consequently, each bucket's size is also a power of two, and the procedure can be applied recursively. This approach can accelerate the scatter phase, since we only need to examine a prefix of the bit representation of each element to determine its bucket.