堆排序

#include <iostream>
using namespace std;

int a[10001];
int n;      


//调整堆
void AdjustHeap(int a[],int i,int size){
    int lchild = 2*i+1;  //注意：这里开始节点编号为0
    int rchild = 2*i+2;
    int temp = i;
    if(i <= (size-1)/2){
        if(lchild <= size && a[lchild] > a[temp]){
            temp = lchild;
        }
        
        if(rchild <= size && a[rchild] >a[temp]){
            temp = rchild;
        }
        
        if(temp != i){
            swap(a[temp],a[i]);
            AdjustHeap(a,temp,size);//递归调用，依次往下调整
        }
    }
}

//建立堆
void BuildHeap(int a[],int size){
    for(int i = (size-1)/2;i >= 0;i--){
        AdjustHeap(a,i,size);
    }
    for(int i=0;i<n-1;i++){      
            cout<<a[i]<<' ';      
        }      
        cout<<a[n-1]<<endl;    
}


//排序
void HeapSort(int a[],int size){
    BuildHeap(a,size);    
    for(int i = size;i >= 0;i--){
        swap(a[0],a[i]);
        AdjustHeap(a,0,i-1);
    }
    
}


int main(){      
    
    while(cin>>n){      
        for(int i=0;i<n;i++){      
            cin>>a[i];      
        }      
        HeapSort(a,n-1);      
        for(int i=0;i<n-1;i++){      
            cout<<a[i]<<' ';      
        }      
        cout<<a[n-1]<<endl;      
    }      
    return 0;      
}