Function sort

src/sort/floyd.rs:11–24

(a: &mut [T])

use crate::common::max_heap;

pub fn sort<T>(a: &mut [T])
where
    T: Ord,
{
    // 构建最大堆
    max_heap::build_heap(a);

    let mut i = a.len();
    while i > 1 {
        i -= 1;
        a.swap(0, i);
        max_heap::heapify(&mut a[0..i], 0);
    }
}