用堆来进行排序

void Swap(int* a, int* b)
{
	int tmp = 0;
	tmp=*a;
	*a = *b;
	*b = tmp;
}
void Down(int* a, int sz, int parent)
{
	int child = parent * 2 + 1;
	while (child <sz)
	{
		if (child + 1 < sz && a[child + 1] > a[child])
		{
			child++;
		}

		if (a[child] > a[parent])
		{
			Swap(&a[child], &a[parent]);
			parent = child;
			child = parent * 2 + 1;
		}
		else
			break;
	}
}
void Heap_sort(int* a, int sz)
{
	for (int i = (sz - 1 - 1) / 2; i >= 0; i--)
	{
		Down(a, sz, i);
	}
	int end = sz - 1;
	while (end > 0)
	{
		Swap(&a[0], &a[end]);
		Down(a, end, 0);
		end--;
	}
}
int main()
{
	int arr[] = { 7,5,4,6,2,3,1 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	Heap_sort(arr, sz);
	for (int i = 0; i < sz; i++)
	{
		printf("%d ", arr[i]);
	}
	
	return 0;
}

时间复杂度为O（N*logN)