堆排序

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;

void Adjust(int arry[], int index, int len)
{
	int lchild = index*2;
	int rchild = index*2+1;
	int max = index;
	if (lchild <= len && arry[lchild] > arry[max])
	{
		max = lchild;
	}
	if (rchild <= len && arry[rchild] > arry[max])
	{
		max = rchild;
	}
	if (max != index)
	{
		swap(arry[max], arry[index]);
		Adjust(arry,max,len);
	}
}

void BuildHeap(int arry[], int len)
{
	for (int i = len/2; i > 0; --i)
	{
		Adjust(arry,i,len);
	}
}

void Heapsort(int arry[],int len)
{
	BuildHeap(arry,len);
	for (int i = len; i > 0; i--)
	{
		swap(arry[1],arry[i]);
		Adjust(arry,1,i-1);
	}
}

int main(int argc, char const *argv[])
{
	int arry[100];
	int len;
	cin>>len;
	for (int i = 1; i <= len; ++i)
	{
		cin>>arry[i];
	}
	Heapsort(arry,len);
	for(int i=1;i<=len;i++)
            cout<<arry[i]<<" ";
	return 0;
}