Function core::slice::heapsort

pub fn heapsort<T, F>(v: &mut [T], is_less: F) where
    F: FnMut(&T, &T) -> bool, 

🔬 This is a nightly-only experimental API. (sort_internals)

Sorts v using heapsort, which guarantees O(n * log(n)) worst-case.