2. Sort a given set of elements using the Heap sort method and determine the time requied to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

#include<stdio.h>
#include<conio.h>
#include<time.h>
void heapsort(int n,int arr[]);
void heapy(int n,int arr[]);
void adjust(int n,int arr[]);
void heapsort(int n,int arr[])
{
int i,item;
delay(100);
heapy(n,arr);
for(i=n;i>=1;i--)
{  
item=arr[1];  
arr[1]=arr[i];  
arr[i]=item;  
adjust(i,arr);
} }
void heapy(int n,int arr[])
{
int i,j,k,item;
for(i=1;i<=n;i++)
{  
item=arr[i];  
j=i;
k=j/2;  
while(k!=0 && item>arr[k])  
{  
arr[j]=arr[k];  
j=k;  
k=j/2;  
}  
arr[j]=item;
} }
void adjust(int n,int arr[])
{  int i,j,item;
j=1;
item=arr[j];
i=j*2;
while(i<n)
{  
if((i+1)<n)  
{  
if(arr[i]<arr[i+1])  
i++;  
}  
if(item<arr[i])  
{  
arr[j]=arr[i];  
j=i;  
i=2*j;  
}  
else  
break;  }
arr[j]=item; }
void main()
{
int i,n,arr[20];
clock_tend,start;
clrscr();
printf("\nEnter the number of Elements: \t");
scanf("%d",&n);
printf("\nEnter the %d Elements:",n);
for(i=1;i<=n;i++)
scanf("%d",&arr[i]);
start=clock();
heapsort(n,arr);
end=clock();
printf("\nSorted Elements are\n");
for(i=1;i<=n;i++)
printf("%d ",arr[i]);
printf("\nTime taken by Heapsort %f CPU Cycle",(end-start)/CLK_TCK);
getch();
}