堆排序（2）

#include<iostream>

#define ElementType int


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


using namespace std;


// 调整堆
void AdjustHeap(ElementType a[], int i, int len)
{
ElementType tmp = a[i];
for (int largest = 2 * i + 1; largest < len; largest = 2 * largest + 1)
{
if (largest != len - 1 && a[largest + 1]>a[largest])
++largest;
if (a[largest] > tmp)
{
a[i] = a[largest];
i = largest;
}
else
break;
}
a[i] = tmp;
}


// 建堆
void BuildMaxHeap(ElementType a[], int len)  // 建一个堆
{
// i=len/2-1 是因为数组元素的下标从0开始，画个草图很容易明白
for (int i = len / 2 - 1; i >= 0; i--)
AdjustHeap(a, i, len);
}


// 堆排序
void HeapSort(ElementType a[], int n)
{
BuildMaxHeap(a, n);
for (int i = n - 1; i > 0; --i)
{
a[0] = a[0] ^ a[i];
a[i] = a[0] ^ a[i];
a[0] = a[0] ^ a[i];
AdjustHeap(a, 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;
}