Function rayon::slice::quicksort::insertion_sort

fn insertion_sort<T, F>(v: &mut [T], is_less: &F)
where
    F: Fn(&T, &T) -> bool,

Sorts a slice using insertion sort, which is O(n^2) worst-case.