Implement Merge Sort in C programming language about git_first HOT 4 CLOSED

/* create temp arrays */
int L[n1], R[n2]; 

/* Copy data to temp arrays L[] and R[] */
for (i = 0; i < n1; i++) 
    L[i] = arr[l + i]; 
for (j = 0; j < n2; j++) 
    R[j] = arr[m + 1+ j]; 

/* Merge the temp arrays back into arr[l..r]*/
i = 0; // Initial index of first subarray 
j = 0; // Initial index of second subarray 
k = l; // Initial index of merged subarray 
while (i < n1 && j < n2) 
{ 
    if (L[i] <= R[j]) 
    { 
        arr[k] = L[i]; 
        i++; 
    } 
    else
    { 
        arr[k] = R[j]; 
        j++; 
    } 
    k++; 
} 

/* Copy the remaining elements of L[], if there 
   are any */
while (i < n1) 
{ 
    arr[k] = L[i]; 
    i++; 
    k++; 
} 

/* Copy the remaining elements of R[], if there 
   are any */
while (j < n2) 
{ 
    arr[k] = R[j]; 
    j++; 
    k++; 
} 

    // Sort first and second halves 
    mergeSort(arr, l, m); 
    mergeSort(arr, m+1, r); 

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