堆排序算法

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int maxx=105;
int pa[maxx];
int n;
void PercolateDown(int pos,int size){
	int p=pos,c=2*p+1;
	int temp=pa[p];
	while(c<size){
		if(c+1<size&&pa[c+1]>pa[c]){
			c++;
		}
		if(temp>=pa[c]){
			break;
		}else{
		    pa[p]=pa[c];
			p=c;
			c=2*p+1;	
		}
	}
	pa[p]=temp;
}
void BuildHeap(int size){
	for(int i=size/2-1;i>=0;i--){
		PercolateDown(i,size);
	}
}
void Heapsort(int n){
	BuildHeap(n);
	int temp;
	for(int i=n-1;i>=0;i--){
		temp=pa[0];
		pa[0]=pa[i];
		pa[i]=temp;
		PercolateDown(0,i);
	}
}
int main(){
	while(scanf("%d",&n)!=EOF){
		for(int i=0;i<n;i++){
			scanf("%d",&pa[i]);
		}
		Heapsort(n);
		for(int i=0;i<n;i++){
			cout<<pa[i]<<" ";
		}
	}
	return 0;
}