#include<stdio.h>

#define MAX 10

void merges(int x[], int end, int start);

int main()
{
    int a[MAX];
    int j = 0;

    printf("\n\nEnter the elements to be sorted: \n");
    for(j=0;j<MAX;j++)
    scanf("%d",&a[j]);

    /* array before mergesort */
    printf("Unsorted List :");
    for(j = 0; j < MAX; j++)
    printf(" %d", a[j]);

    printf("\n");

    merges(a, 0, MAX - 1);

    /* array after mergesort */
    printf("After Merge Sort :");
    for(j = 0; j < MAX; j++)
    printf(" %d", a[j]);

    printf("\n");
    return 0;
}

/* Method to implement Merge Sort*/
void merges(int x[], int end, int start) {
int j = 0;
const int size = start - end + 1;
int mid = 0;
int mrg1 = 0;
int mrg2 = 0;
int executing[MAX];

if(end == start)
return;

mid = (end + start) / 2;

merges(x, end, mid);
merges(x, mid + 1, start);

for(j = 0; j < size; j++)
executing[j] = x[end + j];

mrg1 = 0;
mrg2 = mid - end + 1;

for(j = 0; j < size; j++) {
if(mrg2 <= start - end)
if(mrg1 <= mid - end)
if(executing[mrg1] > executing[mrg2])
x[j + end] = executing[mrg2++];
else
x[j + end] = executing[mrg1++];
else
x[j + end] = executing[mrg2++];
else
x[j + end] = executing[mrg1++];
}
}