堆排序

void HeapSort(int H[],int length) { 
    BuildingHeap(H,length);
    for (int i=length-1;i>0;--i) {
        int temp=H[i];H[i]=H[0];H[0]=temp;
        HeapAdjust(H,0,i);
    }
}

void BuildingHeap(int H[],int length) { 
    for(int i=(length-1)/2;i>=0;i--)
        HeapAdjust(H,i,length);
}

void HeapAdjust(int H[],int s,int length) {
    int temp=H[s];
    int child=2*s+1;
    while(child<length) {
        if(child+1<length && H[child]<H[child+1])
            ++child;
        if(H[s]<H[child]) { 
            H[s]=H[child];
            s=child;
            child=2*s+1;
        }
        else
            break;
        H[s]=temp;
    }
}