Merge sort

#include<stdlib.h>
#include<stdio.h>

void merge(int arr[], int l, int c, int r)
{
    int i, j, k;
    int n1 = c - l + 1;
    int n2 =  r - c;

    int L[n1], R[n2];

    for (i = 0; i < n1; i++)
      {
            L[i] = arr[l + i];
      }
    for (j = 0; j < n2; j++)
      {
            R[j] = arr[c + 1+ j];
      }


    i = 0;
    j = 0;
    k = l;
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            arr[k] = L[i];
            i++;
        }
        else
        {
            arr[k] = R[j];
            j++;
        }
        k++;
    }

    while (i < n1)
    {
        arr[k] = L[i];
        i++;
        k++;
    }

    while (j < n2)
    {
        arr[k] = R[j];
        j++;
        k++;
    }
}
void mergeSort(int arr[], int l, int r)
{
    if (l < r)
    {
        int c = (l+r)/2;

        mergeSort(arr, l, c);
        mergeSort(arr, c+1, r);

        merge(arr, l, c, r);
    }
}

int main()
{
    int n,i;
    scanf("%d",&n);
    int arr[n];
    for(i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
    }

    mergeSort(arr, 0, n-1);

    printf("\nSorted array is \n");
    for(i=0;i<n;i++)
    {
        printf("%d ",arr[i]);
    }
    return 0;
}