注:文章算法部分来自C++ 堆排序算法的实现与改进(含笔试面试题) - MISAYAONE的博客 - CSDN博客 https://blog.csdn.net/misayaaaaa/article/details/65999854
#include "stdafx.h"
#include <iostream>
#include <vector>
using namespace std;
//辅助交换函数
void Swap(int &a, int &b)
{
int temp = a;
a = b;
b = temp;
}
void Heap_build(int a[], int root, int length)
{
int lchild = root * 2 + 1;
if (lchild < length)
{
int flag = lchild;
int rchild = lchild + 1;
if (rchild < length)
{
if (a[rchild] > a[flag])
{
flag = rchild;
}
}
if (a[root] < a[flag])
{
Swap(a[root], a[flag]);
Heap_build(a, flag, length);
}
}
}
void Heap_sort(int a[], int len)
{
for (int i = len / 2; i >= 0; i--)
{
Heap_build(a, i, len);
}
for (int j = len - 1; j > 0; --j)
{
Swap(a[0], a[j]);
Heap_build(a, 0, j);
}
}
int main(int argc, char **argv)
{
int a[10] = { 12,45,748,12,56,3,89,4,48,2 };
Heap_sort(a, 10);
for (int i = 0; i != 10; i++)
{
cout << a[i] << " ";
}
cout << endl;
return 0;
}