堆排序

int maxHeap(int *a,int start,int end){
    int node = start;
    int left = 2*node+1;
    int tmp = a[node];

    for(;left<end;node = left,left=2*node+1){
        if(a[left] < a[left+1] && left<=end)
            left ++;
        if(tmp > a[left])
            break;
        else{
            a[node]=a[left];
            a[left]=tmp;
        }
    }
    return 0;
}

int HeapSort(int *a,int size){

    for(auto i=size/2-1;i>=0;i--){
        maxHeap(a,i,size-1);
    }
    for(auto i=size-1;i>=0;i--){
        int tmp = a[0];
        a[0] = a[i];
        a[i] = tmp;
        maxHeap(a,0,i-1);
    }
    return 0;
}
int main(){
    int a[] = {20,30,90,40,70,110,60,10,100,50,80};
    int ilen = (sizeof(a)) / (sizeof(a[0]));
    //heapSortAsc(a, ilen);
    HeapSort(a,ilen);
    for (auto i=0; i<ilen; i++)
        cout << a[i] << " ";
    return 0;
 }