merge sort program

1. MERGE SORT
#include <stdio.h>
int merge(int a[], int l, int m, int r)
{
int i,j,k,v[100];
i=l,k=0,j=m+1;
while(i<=m&&j<=r) {
if(a[i]<a[j])
{
v[k]=a[i];
i++;
}
else
{
v[k]=a[j];
j++;
}
k++;
}
while(i<=m)
v[k++]=a[i++];
while(j<=r)
v[k++]=a[j++];
for(i=l;i<=r;i++)
a[i]=v[i-l];
}
void merge_sort(int a[],int low,int high)
{
int mid;
if(low<high)
{
mid=((low+high)/2);
merge_sort(a,low,mid);
merge_sort(a,mid+1,high);
merge(a,low,mid,high);
}
}
main() {
int a[100],i,n;
printf("Enter size: ");
scanf("%d",&n);
printf("Enter %d element: ",n);
for(i=0;i<n;i++) {
scanf("%d",&a[i]);
}
merge_sort(a,0, n-1);
for(i=0;i<n;i++) {
printf("%d ", a[i]);
}
scanf("%s");
}