Implement Merge Sort || with simple coding

 // write a program in c to implement
 // Merge shorts  
  #include <stdio.h>

  void printArray(int *A, int n)
  {
    for (int i = 0; i < n; i++)
    {
        printf("%d  ", A[i]);
    }
    printf("\n");
  }

  void merge(int A[], int mid, int low, int high)
  {
    int i, j, k, B[100];
    i = low;
    j = mid + 1;
    k = low;

    while (i <= mid && j <= high)
    {
        if (A[i] < A[j])
        {
            B[k] = A[i];
            i++;
            k++;
        }
        else
        {
            B[k] = A[j];
            j++;
            k++;
        }
     }
     while (i <= mid)
     {
        B[k] = A[i];
        k++;
        i++;
    }
    while (j <= high)
    {
        B[k] = A[j];
        k++;
        j++;
    }
    for (int i = low; i <= high; i++)
    {
        A[i] = B[i];
    }
    
  }

  void mergeSort(int A[], int low, int high){
    int mid; 
    if(low<high){
        mid = (low + high) /2;
        mergeSort(A, low, mid);
        mergeSort(A, mid+1, high);
        merge(A, mid, low, high);
    }
  }

  int main()
 { int n, a[50],i;
    printf("Enter the size of Array :-\n ");
    scanf("%d", &n);

    printf("Enter %d element:-\n ", n);
    for (i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
   printf("your Array : ");
    printArray(a, n);
    mergeSort(a, 0, 6);
    printf("Sorted Array is : ");
    printArray(a, n);
    return 0;
 }

When the above program is executed, it produces following results --

    Enter the size of Array :-
           5
   Enter 5 element:-
    320
   19
   45
   -2
   18
   your Array : 320  19  45  -2  18  
   Sorted Array is : -2  18  19  45  320