Rustlang-堆排序

fn heap_adjust(nums: &mut Vec<usize>, parent: usize, len: usize) {
    let left: usize = parent * 2 + 1;
    let right: usize = parent * 2 + 2;

    if left < len && nums[parent] < nums[left] {
        nums.swap(parent, left);
    }

    if right < len && nums[parent] < nums[right] {
        nums.swap(parent, right);
    }
}
fn build_heap(nums: &mut Vec<usize>, length: usize) {
    for n in 0..length {
        heap_adjust(nums, n, length);
    }
}

pub fn heap_sort(nums: &mut Vec<usize>) {
    for n in 0..nums.len() {
        let len = nums.len() - n;
        build_heap(nums, len);
        nums.swap(0, len - 1);
    }
}

使用

 fn it_works() {
        let mut nums: Vec<usize> = vec![3, 1];
        heap_sort(&mut nums);
        println!("{:?}", nums);
    }