public class HeapSort {
public static void main(String[] args) {
int[] a={49,38,65,97,76,13,27,49,78,34,12,64};
int arrayLength=a.length;
//循环建堆
for(int i=0;i<arrayLength-1;i++){
//建堆
buildMaxHeap(a,arrayLength-1-i);
//交换堆顶和最后一个元素
swap(a,0,arrayLength-1-i);
System.out.println(Arrays.toString(a));
}
}
public static void swap(int[] a,int i,int j){
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}
public static void bulidMaxHeap(int[] a,int maxLength){
//i为最大节点的父节点
for(int i=(maxLength-1)/2;i>=0;i--){
//保存当前节点
int k=i;
//当有子节点的时候
while(2k+1<maxLength)
int largerIndex=2k+1;
if(largerIndex<maxLength){
if(a[largerIndex]<a[ largerIndex+1])
{
largerIndex++;
}
}
if(a[k]<a[largerIndex])
{
swap(a,k,largerIndex);
k=largerIndex;
}
else{
break;
}
}
}