Envío 6913

Código

#include <iostream>

using namespace std;

void display(int *array, int size) {
   for(int i = 0; i<size; i++)
      cout << array[i] << " ";
   cout << endl;
}

void merge(int *a, int l, int m, int r) {
  int i, j, k, nl, nr;
  //size of left and right sub-arrays
  nl = m-l+1; nr = r-m;
  int larr[nl], rarr[nr];
  //fill left and right sub-arrays
  for(i = 0; i<nl; i++) larr[i] = a[l+i];
  for(j = 0; j<nr; j++) rarr[j] = a[m+1+j];

  i = 0; j = 0; k = l;
  //marge temp arrays to real array
  while(i < nl && j<nr) {
    if(larr[i] <= rarr[j]) {
      a[k] = larr[i];
      i++;
    } else {
      a[k] = rarr[j];
      j++;
    }
    k++;
   }
   while(i<nl) {       //extra element in left array
      a[k] = larr[i];
      i++; k++;
   }
   while(j<nr) {     //extra element in right array
      a[k] = rarr[j];
      j++; k++;
   }
}

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

int main() {
  int N;
  cin >> N;
  int a[N];

  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }

  mergeSort(a, 0, N-1);
  display(a, N);
  return 0;
}