#include
#include
void siftDown(int numbers[], int root, int bottom) else

// If we have the correct ordering, we are done.
if(numbers[root] >= numbers[maxChild]) return;

// Swap
int temp = numbers[root];
numbers[root] = numbers[maxChild];
numbers[maxChild] = temp;

// Tail queue recursion.
siftDown(numbers, maxChild, bottom);
}
void heapSort(int numbers[], int array_size)

for (i = array_size-1; i >= 1; i--)
}

int main()

heapSort(A,n);
printf("\n\nSorted List by Heap Sort :\n");
for ( i = 0; i < n; i++)

getch();
}

ARKADAŞLAR KODLAR GORUNDUĞU GİBİ HEAP SORT SIRALAMASI ANCAK HER SATIRI ACIKLAMAMIZ GEREKİYOR TURKCE YAPAMIYORUZ.YARDIMCI OLURSANIZ COK SEVİNİRİZ
__________________