merge_sort.cpp

#include <stdio.h>

void merge(int arr[], int p, int q, int r) {
  int n1 = q - p + 1;
  int n2 = r - q;
  int L[n1], M[n2];
  for (int i = 0; i < n1; i++)
    L[i] = arr[p + i];
  for (int j = 0; j < n2; j++)
    M[j] = arr[q + 1 + j];
  int i, j, k;
  i = 0;
  j = 0;
  k = p;
  while (i < n1 && j < n2) {
    if (L[i] <= M[j]) {
      arr[k] = L[i];
      i++;
    } else {
      arr[k] = M[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    arr[k] = L[i];
    i++;
    k++;
  }

  while (j < n2) {
    arr[k] = M[j];
    j++;
    k++;
  }
}

void merge_sort(int arr[], int l, int r) {
  if (l < r) {
    int m = l + (r - l) / 2;
    merge_sort(arr, l, m);
    merge_sort(arr, m + 1, r);
    merge(arr, l, m, r);
  }
}

void print(int arr[], int leng) {
  for (int i = 0; i < leng; i++)
    printf("%d ", arr[i]);
  printf("\n");
}

int main() {
  int leng;
  scanf("%d",&leng);
  int arr[leng];
  for(int i=0;i<leng;i++){
    scanf("%d",&arr[i]);
  }
  merge_sort(arr,0,leng - 1);
  print(arr, leng);
}