堆排序，分别利用大根堆、小根堆排序

#include <iostream>
using namespace std;
//下沉调整（本质上都是上浮调整，只不过是将最小元素上浮）
void downAdjust(int array[],int parentIndex,int length)
{
	int temp = array[parentIndex];
	int childIndex = 2 * parentIndex + 1;
	while (childIndex < length)     
	{
		if ((childIndex +1< length) &&(array[childIndex + 1] < array[childIndex])) //如果右孩子更小的话，则指向右孩子
		{
			childIndex++;
		}
		if (temp < array[childIndex])
			break;
		array[parentIndex] = array[childIndex];
		parentIndex = childIndex;
		childIndex = 2 * childIndex + 1;
	}
	array[parentIndex] = temp;
}
//上浮调整
void upAdjust(int array[], int parentIndex, int length)
{
	int temp = array[parentIndex];
	int childIndex = 2 * parentIndex + 1;
	while (childIndex < length)
	{
		if (childIndex + 1 < length&&array[childIndex] < array[childIndex + 1])//如果右孩子更大则childIndex指向右孩子
		{
			child