import java.util.Arrays;
public class HeapSort {
public static void main(String[] args) {
int[] arr = {1, 3, 67, 4, 0, 100, 33};
heapSort(arr);
System.out.println(Arrays.toString(arr));
}
public static void heapSort(int[] arr) {
//建堆
int len = arr.length;
for (int i = len / 2 - 1; i >= 0; i--) {//从最后一个节点的父节点开始调整
adjustHeap(arr, i, len - 1);
}
for (int j = len - 1; j > 0; j--) {//交换顶部元素和最后元素,调整arr[0,len-2]
int tem = arr[j];
arr[j] = arr[0];
arr[0] = tem;
adjustHeap(arr, 0, j - 1);
}
}
private static void adjustHeap(int[] arr, int top, int tail) {//top 要调整的节点下标;tail要调整的尾部下标
int child = 2 * top + 1;//左子节点
int temp = arr[top];
while (child <= tail) {
if (child < tail && arr[child + 1] > arr[child]) {
child = child + 1;//child 记录左右节点中最大的
}
if (temp > arr[child]) {
break;
} else {
arr[top] = arr[child];
top = child;
child = 2 * top + 1;
}
}
arr[top] = temp;//top 为遍历后不用往下再调整的点
}
}
堆排序(非递归)
最新推荐文章于 2022-03-27 15:17:59 发布