堆排序算法

#include <iostream>
#include <vector>
#include <string>

using namespace std;

class Solution
{
private:
public:
    void adjustHeap(int a[], int i, int length)
    {
        int temp = a[i];
        for (int k = 2 * i + 1; k < length; k = 2 * k + 1)
        {
            if (k + 1 < length && a[k + 1] > a[k])
            {
                k++;
            }
            if (a[k] > temp)
            {
                a[i] = a[k];
                i = k;
            }
            else
            {
                break;
            }
        }

        a[i] = temp;
    }

    void heapSort(int a[], int length)
    {
        for (int i = length / 2 - 1; i >= 0; i--)
        {
            adjustHeap(a, i, length);
        }

        for (int j = length - 1; j > 0; j--)
        {
            int temp = a[0];
            a[0] = a[j];
            a[j] = temp;

            adjustHeap(a, 0, j);
        }
    }
};

int main()
{
    Solution sol;

    int a[] = {2, 6, 3, 2, 7, 4, 5};
    sol.heapSort(a, 7);

    cout << "hello" << endl;

    return 0;
}