Function introsort::heapsort

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