Function voracious_radix_sort::counting_sort

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

Counting sort

An implementation of the Counting sort algorithm.

Counting sort is very fast for inputs with a small bit representation.

This Counting sort has been a bit customized since it takes a radix input.