public class HeapSort {
public static void main(String[] args) {
int[] arr = new int[] { 0, 3, -9, 6, -8, 5, -10, 7, -11, 19, -30, 12, 23 };
heapSort(arr);
for (int i : arr) {
System.out.print(i);
System.out.print(" ");
}
System.out.println();
}
private static void heapSort(int[] arr) {
// 循环建堆
for (int i = 0; i < arr.length - 1; i++) {
// 建堆
buildMaxHeap(arr, arr.length - 1 - i); // 从最后一个元素上进行,建堆
swap(arr, 0, arr.length - 1 - i);
}
}
private static void buildMaxHeap(int[] arr, int lastIndex) {
for (int flag = lastIndex / 2; flag >= 0; flag--) { // 从上到下的进行遍历
int BigNumNode = 0; // 最大儿子的节点
while (2 * flag + 1 <= lastIndex) {
if (arr[2 * flag + 1] > arr[2 * flag]) {
BigNumNode = 2 * flag + 1;
} else {
BigNumNode = 2 * flag;
}
if (arr[flag] < arr[BigNumNode]) {
swap(arr, flag, BigNumNode);
flag = BigNumNode;
} else {
break;
}
}
}
}
private static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}