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)

internal to sort module

使用堆排序对 v 进行排序，这保证了 O(n*log(* n*)) 最坏的情况。