编辑代码

#include <iostream>
#include <vector>

using namespace std;

void adjustHeap(vector<int>& arr, int i, int length) {
    int temp = arr[i];
    for (int k = 2 * i + 1; k < length; k = 2 * k + 1) {
        if (k + 1 < length && arr[k] < arr[k + 1]) {
            k++;
        }
        if (arr[k] > temp) {
            arr[i] = arr[k];
            i = k;
        } else {
            break;
        }
    }
    arr[i] = temp;
}

void heapSort(vector<int>& arr) {
    int n = arr.size();
    for (int i = n / 2 - 1; i >= 0; i--) {
        adjustHeap(arr, i, n);
    }
    for (int j = n - 1; j > 0; j--) {
        swap(arr[0], arr[j]);
        adjustHeap(arr, 0, j);
    }
}

int main() {
    vector<int> arr = {2, 9, 7, 6, 5, 8};
    heapSort(arr);
    for (int i = 0; i < arr.size(); i++) {
        cout << arr[i] << " ";
    }
    return 0;
}