Editing Bucket sort (section)

==Optimizations==

A common optimization is to put the unsorted elements of the buckets back in the original array ''first'', then run [[insertion sort]] over the complete array; because insertion sort's runtime is based on how far each element is from its final position, the number of comparisons remains relatively small, and the memory hierarchy is better exploited by storing the list contiguously in memory.<ref>Corwin, E. and Logar, A. "Sorting in linear time — variations on the bucket sort". ''Journal of Computing Sciences in Colleges'', 20, 1, pp.197–202. October 2004.</ref>

If the input distribution is known or can be estimated, buckets can often be chosen which contain constant density (rather than merely having constant size). This allows <math>O(n)</math> average time complexity even without uniformly distributed input.