创建一个堆结构heap-build

int max_heapify(int *A, int i, int n){ int left = 2*i; int right = 2*i+1; int largest = i; if( A[ left-1 ] >= A[ i-1 ] && left <= n ) largest = left; if( A[ right-1 ] >= A

>>阅读原文<<