c++堆排序

#include <iostream>
using namespace std;
#include <string.h>
#include <vector>

void maxheap(vector<int>& ans,int i,int n){
    int l = i * 2 + 1;
    int r = i * 2 + 2;
    int max = i;
    if(l < n && ans[l] > ans[max])
        max = l;
    if(r < n && ans[r] > ans[max])
        max = r;
    if(max != i){
        swap(ans[i],ans[max]);
        maxheap(ans,max,n);
    }
}

void makeheap(vector<int>& ans,int n){
    for(int i = n/2 - 1;i >= 0;i--)
        maxheap(ans,i,n);
}


int main()
{
    vector<int> ans = {20,10,49,23,1,39,76,58,19,30};
    vector<int> tem(10,0);
    int n = ans.size() ;
    makeheap(ans,n);
    for(int i = n-1;i >= 0;i--){
        swap(ans[0],ans[i]);
        maxheap(ans,0,i);
    }

    for(int i : ans)
        cout<<i<<endl;



    return 0 ;
}