HeapSort

//堆排序
public class HeapSort {

public static void main(String[] args) {
    int[] arr = {431,9,3,43,65,4,6};
    heapSort1(arr);
    heapSort2(arr);//heapify
    heapSort3(arr);//原地堆排序
}

private static void heapSort3(int[] arr) {
    int n = arr.length;
    for (int i = (n  - 1) / 2; i >= 0 ; i--)
        shiftDown(arr,n,i);
    for (int i = n - 1; i > 0; i--) {
        swap(arr, 0, i);
        shiftDown(arr, i , 0);
    }
    for (int i = 0; i < arr.length; i++)
        System.out.println(arr[i]);
}

private static void shiftDown(int[] arr, int n, int i) {
    while (i * 2 + 1 < n) {
        int j = i * 2 + 1;
        if (j + 1 < n)
            if (arr[j + 1] > arr[j])
                j += 1;
        if (arr[i] < arr[j]) {
            swap(arr,i, j);
            i = j;
        } else
            break;
    }
}

private static void heapSort2(int[] arr) {
    MaxHeap heap = new MaxHeap(arr);
    for (int i = heap.data[0] / 2; i >= 1; i--)
        heap.shiftDown(i);
    for (int i = arr.length - 1; i >= 0; i--)
        arr[i] = heap.extractMax();
    for (int i = 0; i < arr.length; i++)
        System.out.println(arr[i]);
}

private static void heapSort1(int[] arr) {
    MaxHeap maxHeap = new MaxHeap(arr.length);
    for (int i = 0; i < arr.length; i++)
        maxHeap.insert(arr[i]);
    for (int i = arr.length - 1; i >= 0; i--)
        arr[i] = maxHeap.extractMax();
    for (int i = 0; i < arr.length; i++)
        System.out.println(arr[i]);

}
private static void swap(int[] arr,int i, int j) {
    arr[i] = arr[i] ^ arr[j];
    arr[j] = arr[i] ^ arr[j];
    arr[i] = arr[i] ^ arr[j];
}

}