堆排序（向下排序法）

#include<stdio.h>

Swap(int* p1, int* p2)
{
	int tmp = *p1;
	*p1 = *p2;
	*p2 = tmp;
}
void AdjustDown(int*a, int n, int parent)
{
	int child = parent * 2 + 1;
	while (child < n)
	{
		//选出左右孩子最小的
		if (child + 1 < n&&a[child + 1] < a[child])
		{
			child++;
		}
		if (a[child] < a[parent])
		{
			Swap(&a[parent], &a[child]);
			parent = child;
			child = parent * 2 + 1;
		}
		else
		{
			break;
		}
	}
}

//排升序-》大堆
//排降序（选择排序）
HeapSort(int*a, int n)
{
	//建堆 时间复杂度O（N）
	for (int i = (n - 1 - 1) / 2; i >= 0; i++)
	{
		AdjustDown(a, n, i);
	}
	int end = n - 1;
	while (n > 0)
	{
		Swap(&a[0], &a[end]);
		//选出次大的
		AdjustDown(a, end, 0);
		--end;
	}
}

int main()
{
	//向下排序法
	/*int a[10] = { 27, 15, 19, 18, 28, 34, 65, 49, 25, 37 };
	int n = sizeof(a) / sizeof(a[0]);
	AdjustDown(a, n, 0);*/

	//不满足向下排序法
	int a[10] = { 15, 18, 28, 34, 65, 19, 49, 25, 37, 27 };
	int n = sizeof(a) / sizeof(a[0]);
	HeapSort(a, n);

	return 0;
}