堆排序（1）

堆排序的完整实现

#include<iostream>


#define length(array) sizeof(array)/sizeof(array[0])


using namespace std;


void AdjustHeap(int *array, int p, int len)
{
int currentParent = array[p];
int child = 2 * p + 1;   // 左孩子
while (child < len)   // 没有孩子
{
if (child + 1 < len && array[child] < array[child + 1])
{
child++;
}
if (currentParent < array[child])
{
array[p] = array[child];
p = child;
child = 2 * p + 1;
}
else
break;
}
array[p] = currentParent;
}


void HeapSort(int *array, int len)
{
for (int i = len / 2; i >= 0; i--)
{
AdjustHeap(array, i, len);
}
for (int i = len - 1; i >= 0; i--)
{
int maxEle = array[0];
array[0] = array[i];
array[i] = maxEle;
AdjustHeap(array, 0, i);
}
}


void Print(int *array, int len)
{
for (int i = 0; i < len; i++)
{
cout << array[i] << " ";
}
}


int main()
{
int array[] = { 23, 65, 12, 3, 8, 76, 345, 90, 21, 75, 34, 61 };
int len = length(array);
HeapSort(array, len);
Print(array, len);
system("pause");
return 0;
}