1.最小堆,排序,(从大到小)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// 从i节点开始调整,n为节点总数 从0开始计算 i节点的子节点为 2*i+1, 2*i+2
void MinHeapFixdown(int a[], int i, int n)
{
int j, temp;
temp = a[i];
j = 2 * i + 1;
while (j < n)
{
if (j + 1 < n && a[j + 1] < a[j]) //在左右孩子中找最小的
j++;
if (a[j] >= temp)
break;
a[i] = a[j]; //把较小的子结点往上移动,替换它的父结点
i = j;
j = 2 * i + 1;
}
a[i] = temp;
}
//建立最小堆
void MakeMinHeap(int a[], int n)
{
for (int i = n / 2 - 1; i >= 0; i--)
MinHeapFixdown(a, i, n);
}
void MinheapsortTodescendarray(int a[], int n)
{
for (int i = n - 1; i >= 1; i--)
{
swap(a[i], a[0]);
MinHeapFixdown(a, 0, i);
}
}
void Printf(int a[],int n)
{
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
}
int main()
{
int a[10]={9,12,17,30,50,20,60,65,4,19};
MakeMinHeap(a,10);
cout<<"堆化数组为:";
Printf(a,10);
MinheapsortTodescendarray(a,10);
cout<<"堆排序为:";
Printf(a,10);
system("pause");
return 0;
}
参考:https://blog.csdn.net/MoreWindows/article/details/6709644