Function partial_insertion_sort

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

Partially sorts a slice by shifting several out-of-order elements around.

Returns true if the slice is sorted at the end. This function is O(n) worst-case.