Function quickersort::heapsort

pub fn heapsort<T, C: Fn(&T, &T) -> Ordering>(v: &mut [T], compare: &C)

Perform a heapsort using a comparison function.

sort falls back to this for pathological cases.