堆排序

public static void adjustMinHeap(int[] a,int pos,int len){
int temp;
int child;
for(temp=a[pos];2*pos+1<=len;pos=child){
child=2*pos+1;
if(child<len&&a[child]>a[child+1])
child++;
if(a[child]<temp)
a[pos]=a[child];
else
break;
}
a[pos]=temp;
}
public static void myMinHeapSort(int a[]){
int i=0;
int len=a.length;
for(i=len/2-1;i>=0;i--)
adjustMinHeap(a,i,len-1);
for(i=len-1;i>=0;i--){
int temp=a[0];
a[0]=a[i];
a[i]=temp;
adjustMinHeap(a,0,i-1);
}
}