public class Demo {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] aa = getsz(10, 10, 20);
for (int i = 0; i < aa.length; i++) {
System.out.print(aa[i]+" ");
}
System.out.println();
int[] bb = heapsork(aa);
for (int i = 0; i < bb.length; i++) {
System.out.print(bb[i]+" ");
}
}
public static int[] heapsork(int[] num) {
makemaxheap(num);
int temp = 0;
int j = 1;
for (int i = num.length-1; i > 0&&j
temp = num[i];
num[i] = num[0];
num[0] = temp;
downid(num,0,num.length-j);
}
return num;
}
public static int[] makemaxheap(int[] Num) {
int length = Num.length;
for (int i = length/2-1; i > -1; i--) {
downid(Num,i,length);
}
return Num;
}
public static void downid(int[] num, int i,int length) {
// TODO Auto-generated method stub
int left = 2*i+1;
int right = 2*i+2;
int max = left;
if (left>=length) {
return;
}
if (right>=length) {
max = left;
}else if (num[right]>num[left]) {
max = right;
}
if (num[i]>num[max]) {
return;
}else {
int temp = num[max];
num[max] = num[i];
num[i] = temp;
}
downid(num,max,length);
}
public static int[] getsz(int length,int min,int max) {
int[] sz = new int[length];
for (int i = 0; i < sz.length; i++) {
sz[i] = (int)(Math.random()*max);
}
return sz;
}
}