排序算法——堆排序（C++）

//堆排序
//需要先做heapify操作
void heapify(vector<int> &tree,int n, int i)   //tree代表需要处理的数组，n代表数组长度，i代表是需要对哪个节点进行操作。
{
    if(i >= n){
        return;
    }
    int c1 = 2 * i + 1;
    int c2 = 2 * i + 2;
    int max = i;
    if(c1 < n && tree[c1] > tree[max])
        max = c1;
    if(c2 < n && tree[c2] > tree[max])
        max = c2;
    if(max != i){
        swap(tree[i],tree[max]);
        heapify(tree, n,max);
    }
}

void heap_sort(vector<int> &tree,int n)
{
    int last_node = n - 1;
    int parent = (last_node-1)/2;
    for(int i = parent;i >=0;i--)
    {
        heapify(tree,n,i);
    }

    for(int i = n-1;i >=0;i--)
    {
        swap(tree[i],tree[0]);
        heapify(tree,i,0);
    }
}
int main()
{
    vector<int> tree;
    tree.push_back(2);
    tree.push_back(5);
    tree.push_back(3);
    tree.push_back(1);
    tree.push_back(10);
    tree.push_back(4);
    int n = tree.size();

    heap_sort(tree,n);
    for(int i = 0;i < n;i++)
        cout<<tree[i]<<" ";
    cout<<endl;
    return 0;
}