堆排序

import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);

    int[] tree = {2,5,3,1,10,4};
       heap_sort(tree, 6);
        for(int i = 0; i < 6; i++)
            System.out.println(tree[i]);

}
static void heapify(int tree[], int n, int i){//堆化，使当前节点值大于子树值
    if(i >= n)return ;
    int c1 = 2 * i + 1;
    int c2 = 2 * i + 2;
    int max = i;
    if(c1 < n && tree[c1] > tree[max])
        max = c1;
    if(c2 < n && tree[c2] > tree[max])
        max = c2;
    if(max != i){
        swap(tree, max, i);
        heapify(tree, n, max);
    }
}
static void swap(int tree[], int i, int j){
    int t = tree[i];
    tree[i] = tree[j];
    tree[j] = t;
}

static void build_heap(int[] tree, int n){//建堆
int last_node = n - 1;
int parents = (last_node - 1) / 2;
for(int i = parents; i >= 0; i–){
heapify(tree, n, i);
}
}
static void heap_sort(int[] tree, int n){//堆排
build_heap(tree, n);
int i;
for(i = n - 1; i >= 0; i–){
swap(tree, i , 0);
heapify(tree, i, 0);
}
}
}