堆排序

堆排序的思想很简单，但是有些实现的地方需要注意，最近写了写堆排序进行练手

：

package HeapsortTest;


public class Heapsort {
public static void main(String[] args) {
int[] array = { 17, 8, 45, 84, 2, 94,432,34,35,2354 };
int L=array.length;
heapsort(array);
int []newarray=Sort(array);
heapsort(newarray);
while(newarray.length>0)
{
newarray=Sort(newarray);
heapsort(newarray);
}


}
public static int[] Sort(int []array)
{
int L=array.length;
int []newArray = null;
if(L>0)
{
System.out.print(array[0]+"\t");
newArray=new int[L-1];
array[0]=array[L-1];
for(int i=0;i<L-1;i++)
newArray[i]=array[i];
}
return newArray;
}
public static void heapsort(int[] array) {
int L = array.length;
if (L > 0) {
heapTree(array, 0);
}
}


public static void heapTree(int[] array, int a) {// array需要传入的数组，a需要调整的数的位置
int L = array.length,temp;
int flag = 0, left = a * 2 + 1, right = a * 2 + 2;
// 把子树变为最大堆
if (left < L) {
if (array[a] < array[left]) {
// swap(array[a], array[left]);
temp = array[a];
array[a] = array[left];
array[left] = temp;
flag = 1;
}
heapTree(array, left);
}


if (right < L) {
if (array[a] < array[right]) {
// swap(array[a], array[right]);
temp = array[a];
array[a] = array[right];
array[right] = temp;
flag = 1;
}


heapTree(array, right);
}
if(flag==1)
heapTree(array, a);
}
}