用二叉树排序

#include <stdio.h>
//调整index下标节点
void reheap(int arr[],size_t n,int index){
int key = arr[index];
int child = 2index+1;
while(child<n){//存在子节点
if(child+1<n && arr[child+1]>arr[child]){
++child; //取右子节点和左子节点中较大的一个
}
if(key<arr[child]){
arr[index] = arr[child];//把子节点中较大值放到根节点处
index = child;
child = 2index+1;
}else{
break;
}
}
arr[index] = key;
}

void heapsort(int arr[],size_t n){
//把arr调整大栈堆
int i;
for(i=n/2-1;i>=0;–i){
reheap(arr,n,i);
}
for(i=n-1;i>=0;–i){
int tmp = arr[0];
arr[0] = arr[i];
arr[i] = tmp;
reheap(arr,i,0);
}
}

void showarr(int arr[],size_t n){
int i;
for(i=0;i<n;i++){
printf("%d “,arr[i]);
}
printf(”\n");
}

int main(){
int arr[] = {0,7,2,3,9,5,6,10,1,6,2,4,8};
size_t n = sizeof(arr)/sizeof(arr[0]);
heapsort(arr,n);
showarr(arr,n);
return 0;
}