[−][src]Function voracious_radix_sort::msd_radixsort
pub fn msd_radixsort<T: Radixable<K>, K: RadixKey>(arr: &mut [T], radix: usize)
MSD sort
An implementation of the MSD sort algorithm.
Implementation has been deeply optimized:
- Small preliminary check to skip prefix zero bits.
- Use vectorization.
We choose to use an out of place implementation to have a fast radix sort for small input. This sort is used as a fallback for other radix sort from this crate.
The Verge sort pre-processing heuristic is also added.
The MSD sort is an out of place unstable radix sort.