資料結構

 1  #include <stdio.h>
 2  #include <stdlib.h>
 3  int counter=0;
 4  void max_heapify(int A[],int n,int i) {
 5      int largest=i;
 6      int left=2*i+1;
 7      int right=2*i+2;
 8      counter++;
 9      if (left<n && A[left]>A[i])
10          largest=left;
11      if (right<n && A[right]>A[largest])
12          largest=right;
13      if (largest!=i) {
14          int temp=A[i];
15          A[i]=A[largest];
16          A[largest]=temp;
17          max_heapify(A,n,largest);
18      }
19  }
20  void build_heap(int A[],int n) {
21      for (int i = (n/2)-1;i>=0;i--)
22          max_heapify(A,n,i);
23  }
24  int main(){
25      int A[]={4,1,3,2,16,9,10,14,8,7};
26      int n = sizeof(A)/sizeof(A[0]);
27      build_heap(A,n);
28      for (int i=0;i<n;++i)
29          printf("%d,",A[i]);
30      printf("\n");
31      printf("counter:%d\n",counter);
32      return 0;
33  }