Editing Radix sort (section)

===Hybrid approaches===
Radix sort, such as the two-pass method where [[counting sort]] is used during the first pass of each level of recursion, has a large constant overhead. Thus, when the bins get small, other sorting algorithms should be used, such as [[insertion sort]]. A good implementation of insertion sort is fast for small arrays, stable, in-place, and can significantly speed up radix sort.