chapter §30 堆排序

思想

堆：对于含n个关键字的序列L[1，……，n]，将其视为一棵完全二叉树，根结点i对应左右孩子分别为2i和2i+1，当根结点关键字L[i]大于等于左右子树的关键字时称为大根堆，当根结点小于等于左右子树关键字时，称为小根堆。
堆排序：将堆顶元素和堆底元素交换，重新调整成堆，重复进行，直到堆中只有一个元素。

#include <iostream>

using namespace std;
const int MAX = 50;
int Heap[MAX] = {0, 32, 66, 64, 57, 27, 18, 12, 11, 10, 8, 5, 2, 1};
int n = 13;

void downAdjust(int num, int len) { //对以编号num为根的子树进行向下调整，len为最后一个结点的编号
    int i = num, j = i * 2;
    while (j <= len) {
        if (j + 1 <= len && Heap[j] < Heap[j + 1])
            j = j + 1;//j保存较大孩子编号
        if (Heap[i] < Heap[j]) {
            swap(Heap[i], Heap[j]);
            i = j;
            j = i * 2;
        } else break;
    }
}

void upAdjust(int num) {//对插入编号为num的结点向上调整
    int i = num, j = i / 2;
    while (j >= 1) { //1为根结点
        if (Heap[i] > Heap[j]) {
            swap(Heap[i], Heap[j]);
            i = j;
            j = i / 2;
        } else break;
    }
}

void createHeap() { //创建堆
    for (int i = n / 2; i >= 1; --i) {
        downAdjust(i, n);
    }
}

void deleteTop() {//删除堆顶元素
    Heap[1] = Heap[n--];
    downAdjust(1, n);
}

void insert(int x) { //插入元素
    Heap[++n] = x;
    upAdjust(n);
}

void heapSort() { //堆排序
    for (int i = n; i > 1; --i) {
        swap(Heap[1], Heap[i]);
        downAdjust(1, i - 1);
    }
}

int main() {
    createHeap();
    cout << "初始堆：";
    for (int i = 1; i <= n; ++i) {
        cout << Heap[i] << " ";
    }
    heapSort();
    cout << endl << "堆排序：";
    for (int i = 1; i <= n; ++i) {
        cout << Heap[i] << " ";
    }

    return 0;

}