堆排序
#include<iostream>
using namespace std;
void sift(int arr[], int len, int index)
{
int maxindex = index;
int l = 2 * index + 1;
int r = 2 * index + 2;
if (l < len && arr[maxindex] < arr[l])
maxindex = l;
if (r < len && arr[maxindex] < arr[r])
maxindex = r;
if (maxindex != index)
{
swap(arr[maxindex], arr[index]);
sift(arr, len, maxindex);
}
}
void HeapSort(int arr[], int n)
{
for (int i = n / 2 - 1; i >= 0; i--)
sift(arr, n, i);
for (int i = n - 1; i >= 1; i--)
{
swap(arr[0], arr[i]);
sift(arr, i, 0);
}
}
int main()
{
int a[10] = { 10,9,14,7,6,23,4,3,11,1 };
HeapSort(a, 10);
for (int i = 0; i < 10; i++)
cout << a[i] << " ";
return 0;
}