#include<stdio.h>
#include<time.h>
void merge(int a[],int low, int high, int mid)
{
int i, j, k, c[2000];
i=low;
j=mid+1;
k=low;
while((i<=mid)&&(j<=high))
{
if(a[i]<a[j]) 
{
c[k]=a[i];
k++;
i++;
}
else
{
 
c[k]=a[j];
k++;
j++;
}
}
while(i<=mid)
{
c[k]=a[i];
k++;
i++;
}
while(j<=j-high)
{
c[k]=a[j];
k++;
j++;
}
for(i=low;i<k;i++)
{
a[i]=c[i];
}
}
int main()
{
int n, a[2000],i;
clock_t st, et;
double ts;
printf("enter the size");
scanf("%d",&n);
printf("the random number are \n");
for(i=0;i<n;i++)
{
a[i]=rand();
printf("%d\t",a[i]);
}
st=clock();
mergesort(a, 0,n-1) ;
et=clock();
ts=(double)(et-st)/CLOCK_PER_SEC;
printf("\n  ***************************\n");
printf("\n after sorting");
for(i=0;i<n;i++)
printf("%d\t",a[i]);
printf("\n the time taken is%e",ts);
}

I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8dGltZS5oPgp2b2lkIG1lcmdlKGludCBhW10saW50IGxvdywgaW50IGhpZ2gsIGludCBtaWQpCnsKaW50IGksIGosIGssIGNbMjAwMF07Cmk9bG93OwpqPW1pZCsxOwprPWxvdzsKd2hpbGUoKGk8PW1pZCkmJihqPD1oaWdoKSkKewppZihhW2ldPGFbal0pIAp7CmNba109YVtpXTsKaysrOwppKys7Cn0KZWxzZQp7CgpjW2tdPWFbal07CmsrKzsKaisrOwp9Cn0Kd2hpbGUoaTw9bWlkKQp7CmNba109YVtpXTsKaysrOwppKys7Cn0Kd2hpbGUoajw9ai1oaWdoKQp7CmNba109YVtqXTsKaysrOwpqKys7Cn0KZm9yKGk9bG93O2k8aztpKyspCnsKYVtpXT1jW2ldOwp9Cn0KaW50IG1haW4oKQp7CmludCBuLCBhWzIwMDBdLGk7CmNsb2NrX3Qgc3QsIGV0Owpkb3VibGUgdHM7CnByaW50ZigiZW50ZXIgdGhlIHNpemUiKTsKc2NhbmYoIiVkIiwmbik7CnByaW50ZigidGhlIHJhbmRvbSBudW1iZXIgYXJlIFxuIik7CmZvcihpPTA7aTxuO2krKykKewphW2ldPXJhbmQoKTsKcHJpbnRmKCIlZFx0IixhW2ldKTsKfQpzdD1jbG9jaygpOwptZXJnZXNvcnQoYSwgMCxuLTEpIDsKZXQ9Y2xvY2soKTsKdHM9KGRvdWJsZSkoZXQtc3QpL0NMT0NLX1BFUl9TRUM7CnByaW50ZigiXG4gICoqKioqKioqKioqKioqKioqKioqKioqKioqKlxuIik7CnByaW50ZigiXG4gYWZ0ZXIgc29ydGluZyIpOwpmb3IoaT0wO2k8bjtpKyspCnByaW50ZigiJWRcdCIsYVtpXSk7CnByaW50ZigiXG4gdGhlIHRpbWUgdGFrZW4gaXMlZSIsdHMpOwp9