C语言实现堆排序

#include<stdio.h>
void printfTree(int* tree,int size){
int i;
int j;
int temp;
int sum;
i=0;
j=1;
sum=j;
while(i<size){
temp=tree[i];
printf("%d\t",temp);
i++;
if(i==sum){
printf("\n");
j*=2;
sum+=j;
}


}
}
/*
 *mode  
 */
int sort(int* tree,int* size,int node){

int child_left=2*node+1;
int child_right=2*node+2;
int father;
int temp;
int min;

if(child_left<*size){
sort(tree,size,child_left);
// printf("1\n");
}
if(child_right<*size){
sort(tree,size,child_right);
}
if(node){
if(node/2*2<node)
father=(node-1)/2;
else
father=(node-1)/2;
if(tree[father]>tree[node]){
temp=tree[father];
tree[father]=tree[node];
tree[node]=temp;
}
}else{
min=tree[0];
tree[0]=tree[*size-1];
*size=*size-1;
return min;
}
return 0;
}
int main(){
int a[]={7,6,8,1,3,5,4,2,9,11,10,12};
int i=0;
int size=12;
printfTree(a,size);
printf("\n");
while(size){
printf("%d\t  size:%d\n",sort(a,&size,0),size);




}
// printfTree(a,size);





return 0;
}