博客

#include <iostream>
using namespace std;
void sift(int r[], int k, int end)
{
    int i, j;
    i = k;
    j = 2 * i;
    while (j <= end)
    {
        if (j < end && r[j] < r[j + 1])
        {
            j++;
        }
        if (r[i] < r[j])
        {
            r[0] = r[i];
            r[i] = r[j];
            r[j] = r[0];
        }
        i = j;
        j = i * 2;
    }
}
void HeapSort(int r[], int n)
{
    for (int k = n / 2; k >= 1; k--)
    {
        sift(r, k, n);
    }
    for (int k = 1; k < n; k++)
    {
        r[0] = r[1];
        r[1] = r[n - k + 1];
        r[n - k + 1] = r[0];
        sift(r, 1, n-k);
    }
}
void Print(int r[],int n)
{
    cout<<"result:"<<endl;
    for(int i=1;i<=n;i++)
    {
        cout<<r[i]<<" "<<endl;
    }
}
int main()
{
    int n;
    int r[25];
    cout << "input n" << endl;
    cin >> n;
    cout << "input one by one" << endl;
    for (int i = 1; i <= n; i++)
    {
        cin >> r[i];
    }
    HeapSort(r,n);
    Print(r,n);
}

运行截图