埋vizee的墓

#define PARENT(__i) (__i / 2) #define LEFT(__i) (__i * 2) #define RIGHT(__i) (__i * 2 + 1) int heap_size,length; /*inline*/void exchange(int *a,int *b) { *a ^= *b; *b = *a ^ *b; *a ^= *b; return

int length; /*inline*/void exchange(int *a,int *b) { *a ^= *b; *b = *a ^ *b; *a ^= *b; return; } void bubblesort(int A[]) { int i,j; for(i = 1;i <= length;i++) for(j = length;j > i;j--)