MergeSort Final

#include <stdio.h>
void mergesort(int a[],int beg,int end);
void merge(int a[],int beg,int mid,int end);
int i,j,k,n;
int a[10],temp[10];
void main() {
printf("Enter the size of array: ");
scanf("%d",&n);
printf("Enter the elements: ");
for(i=0;i<n;i++) {
scanf("%d", &a[i]);
}
printf("The sorted array is : ");
mergesort(a,0,n-1);
for (i=0;i<n;i++) {
printf("%d ",a[i]);
}
printf("\n");
}
void mergesort(int a[], int beg, int end) {
if (beg<end) {
int mid=(beg+end)/2;
mergesort(a,beg,mid);
mergesort(a,mid+1,end);
merge(a,beg,mid,end);
}
}
void merge(int a[],int beg,int mid,int end)
{
int i=beg;
int j=mid+1;
int index=0;
while (i<=mid && j<=end) {
if (a[i]<a[j]) {
temp[index]=a[i];
i++;
}
else {
temp[index]=a[j];
j++;
}
index++;
}
while (i<=mid) {
temp[index]=a[i];
i++;
index++;
}
while (j<=end) {
temp[index]=a[j];
j++;
index++;
}
k=beg;
index = 0;
while (k<=end) {
a[k]=temp[index];
k++;
index++;
}
}