堆排序

package sort;

public class HeapSort1 {

    public static void Heapify(int array[],int length){
         for(int i=length/2 ; i >= 0; i-- ){
             SiftDown(array,i,length);
         }
    }

    public static void SiftDown(int array[], int i,int length){
        while(2 * i + 1 < length){
            int child = 2 * i + 1;
            if((child + 1 < length) && array[child] < array[child + 1]){
                child++;
            }
            if(array[child] > array[i]){
                swap(array,child , i);
                i = child;
            }else
                return;
        }
    }

    public  static void swap(int array[],int i, int j) {
        int temp = array[i];
        array[i] = array[j];
        array[j] = temp;
    }

    public static void HeapSort(int array[],int length){
        Heapify(array, length);
        while(length - 1 > 0){ 
            swap(array,0,length - 1);
            SiftDown(array, 0, length - 1);
            length--;
        }
    }
    public static void main(String[] args) {
        long start = System.nanoTime();
         int array[] = {19, 17, 16, 12, 9, 15, 1, 2, 11, 7, 3, 10, 14};
         HeapSort(array,array.length); 
         for(int k = 0;k < array.length;k++)
             System.out.print(array[k]+" ");
         long end = System.nanoTime();
            System.out.println("time "+ (end - start));
    }

}