C Program to Sort Numbers in Ascending Order using HEAP  SORT

#include <stdio.h>

int main()
{
int heap[10], no, i, j, c, root, temp;

printf("Enter no of elements :\n");
scanf("%d", &no);
printf("Enter the data/elements:\n");
for (i = 0; i < no; i++)
scanf("%d", &heap[i]);
for (i = 1; i < no; i++)
{
c = i;
do
{
root = (c - 1) / 2;
                if (heap[root] < heap[c])
{
temp = heap[root];
heap[root] = heap[c];
heap[c] = temp;
}
c = root;
} while (c != 0);
}
printf("Heap array is : \t");
for (i = 0; i < no; i++)
printf("%d\t ", heap[i]);
for (j = no - 1; j >= 0; j--)
{
temp = heap[0];
            heap[0] = heap[j];
heap[j] = temp;
root = 0;
do
{
                c = 2 * root + 1;
if ((heap[c] < heap[c + 1]) && c < j-1)
c++;
                if (heap[root]<heap[c] && c<j)
{
temp = heap[root];
heap[root] = heap[c];
heap[c] = temp;
}
root = c;
} while (c < j);
}
printf("\nThe sorted array is :\t");
for (i = 0; i < no; i++)
printf("\t %d", heap[i]);
return 0;
}