p3man

#include<stdio.h>
#include<time.h>
#define MAXSIZE 30000
#define NTIMES 5000
void merge(int a[],int low,int mid,int high)
{
 int i,j,k,p;
 int b[MAXSIZE];
 i=low;
 j=mid+1;
 k=low;
 while(i<=mid&&j<=high)
 {
 if(a[i]<=a[j])
 {
 b[k]=a[i];
 i=i+1;
 }
 else
 {
b[k]=a[j];
 j=j+1;
 }
 k=k+1;
 }
 while(i<=mid)
 {
 b[k]=a[i];
 i=i+1;
 k=k+1;
 }
 while(j<=high)
 {
 b[k]=a[j];
 j=j+1;
 k=k+1;
 }
for(i=low;i<=high;i++)
 {
 a[i]=b[i];
 }
}
void mergesort(int a[],int low,int high)
{
 int mid;
 if(low<high)
 {
 mid=(low+high)/2;
 mergesort(a,low,mid);
 mergesort(a,mid+1,high);
 merge(a,low,mid,high);
 }
}
int main()
{
int a[MAXSIZE],j,i,n,k;
double runtime=0;
 clock_t start,end;
 printf("Enter the value of n\n");
 scanf("%d",&n);
 for(k=1;k<=NTIMES;k++)
 {
 srand(1);
 for(i=1;i<=n;i++)
 a[i]=rand();
 start=clock();
 mergesort(a,1,n);
 end=clock();
 runtime=runtime+((end-start)/CLK_TCK);
 }
 runtime=runtime/NTIMES;
 printf("\nSorted elements are\n");
 for(i=1;i<=n;i++)
 printf("%d\n",a[i]);
 printf("Time taken for sorting is %lf seconds",runtime);
}