堆排序

//堆排序


#include<iostream>
#include<string>


using namespace std;


void adjustDown(int array[], int len, int k){ // k是要调整的元素的位置 
int temp = array[k];
int index = k;
for(int i=2*k+1; i<len; i=2*i+1){
if( i<len-1 && array[i]<array[i+1] ){
i++;
}
if( array[i]>array[index] ){
array[index] = array[i];
index = i;
}else{
break;
}
}
array[index] = temp;

for(int i=0; i<len; ++i){
cout<<array[i]<<" ";
}
cout<<endl;
}


void buildHeap(int array[], int len){
int n = len/2-1;
for(int i=n; i>=0; i--){
cout<<"i="<<i<<endl;
adjustDown(array,len,i);


}
}


void swap(int &x, int &y){
int temp = x;
x = y;
y = temp;
}


void heapSort(int array[], int len){
buildHeap(array,len);
for(int i=len-1; i>0; --i){
swap(array[0],array[i]);
adjustDown(array,i,0);
}

}


int main(){
int array[10] ={
1,2,3,4,5,9,8,7,6,0
};
// adjustDown(array,5,1);
// buildHeap(array,5);
heapSort(array,10);
for(int i=0; i<10; ++i){
cout<<array[i]<<" ";
}


return 0;
}