堆排序算法

堆排序算法：
“堆”定义
　　n个关键字序列Kl，K2，…，Kn称为(Heap)，当且仅当该序列满足如下性质(简称为堆性质)：(1) ki≤K2i且ki≤K2i+1 或(2)Ki≥K2i且ki≥K2i+1(1≤i≤ n) //ki相当于二叉树的非叶结点，K2i则是左孩子，k2i+1是右孩子若将此序列所存储的向量R[1..n]看做是一棵完全二叉树的存储结构，则堆实质上是满足如下性质的完全二叉树：树中任一非叶结点的关键字均不大于(或不小于)其左右孩子(若存在)结点的关键字。

public class HeapSort {
private int[] heap;
public HeapSort(int[] heap) {
this.heap = heap;
}

//
public void sort(int length) {
//原始数据
for (int i = 0; i <= length; i++) {
System.out.print(heap[i]+",");
}
System.out.println();

int temp;//暂存变量

for (int i = length / 2; i >= 0; i--) {
createHeap(i, length);
}

for (int i = length; i >= 1; i--) {
temp = heap[i];//heap的root值和最后一个值交换
heap[i] = heap[0];
heap[0] = temp;
createHeap(0, i - 1);//利用已经基本成型的堆，对堆剩余元素进行重建堆
}
//堆排序结果
for (int i = 0; i <= length; i++) {
System.out.print(heap[i]+",");
}
}

private void createHeap(int root, int length) {

int temp = heap;
int j = 2 * root + 1;
int finish = 0;// 预设堆建立尚未完成

while (j <= length && finish == 0) {
if (j < length) {
//找最大的子结点
if (heap[j] < heap[j + 1]) {
j++;
}
}
if (temp >= heap[j]) {
finish = 1;//基本堆建成
} else {
heap[(j - 1) / 2] = heap[j];
j = 2 * j + 1;
}
}
heap[(j - 1) / 2] = temp;//父节点=root结点的值
}

public static void main(String[] args) {
int[] heap = { 10, 32, 1, 9, 5, 7, 12, 0, 4, 3 };
HeapSort heapsort = new HeapSort(heap);
heapsort.sort(heap.length - 1);
}

}