public static void heapSort(int[] arrs){
for(int i=arrs.length/2-1;i>=0;i--){
adjustHeap(arrs,i,arrs.length);
}
for(int i=arrs.length-1;i>0;i--){
int tenp=arrs[i];
arrs[i]=arrs[0];
arrs[0]=tenp;
adjustHeap(arrs,0,i);
}
}
public static void adjustHeap(int[] arrs,int i,int length){
int temp=arrs[i];
for(int j=i*2+1;j<length;j=j*2+1){
if(j+1<length && arrs[j]<arrs[j+1]){
j++;
}
if(arrs[j]>temp){
arrs[i]=arrs[j];
i=j;
}else{
break;
}
}
arrs[i]=temp;
}