HEAP SORT - DSTC using C Language (Source Code Implemented)

HEAP SORT
Implemented using C Language

C Language Code:  

---

HEAP.C

---

 // HEAP SORTING using C Language

#include <stdlib.h>
#include <stdio.h>
#include <process.h>

#define NUM_ITEMS 8

void heapSort(int numbers[], int array_size);
void siftDown(int numbers[], int root, int bottom);
void prnArray(int numbers[], int array_size) ;

int numbers[NUM_ITEMS];

int main()
{
    int i;
    clrscr() ;
    //seed random number generator
    srand(getpid());

    //fill array with random integers
    for (i = 0; i < NUM_ITEMS; i++)
        numbers[i] = rand();

    printf("\nBefore Heap sort.\n");
    prnArray(numbers, NUM_ITEMS) ;

    //perform heap sort on array
    heapSort(numbers, NUM_ITEMS);

    printf("\nAfter Heap sort\n");
    prnArray(numbers, NUM_ITEMS) ;

}

void heapSort(int numbers[], int array_size)
{
    int i, temp;

    for (i = (array_size / 2)-1; i >= 0; i--)
        siftDown(numbers, i, array_size);

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

        temp = numbers[0];
        numbers[0] = numbers[i];
        numbers[i] = temp;
        siftDown(numbers, 0, i-1);
    }
}

void siftDown(int numbers[], int root, int bottom)
{
    int done, maxChild, temp;

    done = 0;
    while ((root*2 <= bottom) && (!done))
    {
        if (root*2 == bottom)
            maxChild = root * 2;
        else if (numbers[root * 2] > numbers[root * 2 + 1])
            maxChild = root * 2;
        else
            maxChild = root * 2 + 1;

        if (numbers[root] < numbers[maxChild])
        {
            temp = numbers[root];
            numbers[root] = numbers[maxChild];
            numbers[maxChild] = temp;
            root = maxChild;
        }
        else
            done = 1;
    }
}

void prnArray(int numbers[], int array_size)
{
    int x ;
    for(x=0; x < array_size; x++)
        printf("%d\t", numbers[x]) ;
}