pub fn quicksort<T, F>(v: &mut [T], is_less: F)where F: FnMut(&T, &T) -> bool,
slice_internals
Sorts v using pattern-defeating quicksort, which is O(n * log(n)) worst-case.
v