堆排序

#include<iostream>
#include <stdio.h>

using namespace std;


void heapify(int tree[],int n,int 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[max],tree[i]);
    heapify(tree,n,max);
}

}
void BuildHeap(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);

     }
}
void HeapSort(int tree[],int n)
{
     BuildHeap(tree,n);
     for(int i=n-1;n>=0;i--)
     {
          swap(tree[i],tree[0]);
          heapify(tree,i,0);
          if(i==0)
               break;
     }

}

int main()
{
    int tree[] ={2,5,3,1,10,1,0,-5,8,73,6,27,-31,14};
    int n=14;
    HeapSort(tree,n);

    for(int i=0;i<n;i++)
     printf("%d\n",tree[i]);

return 0;
}

关于堆排序的原理以及程序的过程参考这个视频
https://www.bilibili.com/video/av47196993/

来源：CSDN

作者：逍遥子.

链接：https://blog.csdn.net/qq_28234239/article/details/103464323