pub fn quicksort<T, F>(v: &mut [T], is_less: F)
🔬This is a nightly-only experimental API. (
slice_internals
)Expand description
Sorts v
using pattern-defeating quicksort, which is O(n * log(n)) worst-case.
pub fn quicksort<T, F>(v: &mut [T], is_less: F)
slice_internals
)Sorts v
using pattern-defeating quicksort, which is O(n * log(n)) worst-case.