Java 堆排序

public class HeapSort {
    public static void main(String[] args) {
        int[] a = new int[]{6, 2, 8, 3, 5, 1, 8, 6, 54, 64, -1, 2, 4, 4, 67};
        heapSort(a);
        System.out.println();
    }

    static void heapSort(int[] a) {
        int bounds = a.length;
        for (int i = bounds - 1; i >= 0; i--) maxHeap(i, bounds, a);
        while (bounds > 0) {
            int t = a[0];
            a[0] = a[bounds - 1];
            a[bounds - 1] = t;
            bounds--;
            for (int i = bounds - 1; i >= 0; i--) maxHeap(i, bounds, a);
        }
    }

    static void maxHeap(int r, int bounds, int[] a) {
        int left = (r + 1) * 2 - 1, right = left + 1;
        if (left >= bounds) return;
        if (right >= bounds) {
            if (a[left] > a[r]) {
                int t = a[left];
                a[left] = a[r];
                a[r] = t;
                maxHeap(left, bounds, a);
            }
            return;
        }
        if (a[left] > a[right]) {
            int t = a[left];
            a[left] = a[right];
            a[right] = t;
        }
        if (a[right] > a[r]) {
            int t = a[right];
            a[right] = a[r];
            a[r] = t;
            maxHeap(right, bounds, a);
            return;
        }
    }
}