Function voracious_radix_sort::msd_stable_radixsort

source · 
pub fn msd_stable_radixsort<T: Radixable<K>, K: RadixKey>(
    arr: &mut [T],
    radix: usize
)
Expand description

MSD stable 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.

The Verge sort pre-processing heuristic is also added.

This MSD sort is an out of place stable radix sort.