Function quickersort::insertion_sort

pub fn insertion_sort<T, C: Fn(&T, &T) -> Ordering>(v: &mut [T], compare: &C)

Perform an insertion sort using a comparison function.

sort falls back to this for small partitions.