Function kvarn_async::prelude::compact_str::core::slice::sort::heapsort
source · 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
)Expand description
Sorts v
using heapsort, which guarantees O(n * log(n)) worst-case.