Envío 6090

Código

#include <bits/stdc++.h>
using namespace std;

void merge(int *arr, int l, int m, int r){
    int i, j, k;
    int n1 = m - l + 1;
    int n2 = r - m;
    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[m + 1 + j];
  
    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++;
    }
  
    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 || l<0) return;
    int m = l + (r-l)/2;
    mergeSort(arr, l, m);
    mergeSort(arr, m+1, r);
    merge(arr, l, m, r);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 
    // your code goes here
    int N, i;
    cin >> N;
    int arr[N];
    for(i=0; i<N; i++)
        cin >> arr[i];
    mergeSort(arr, 0, N-1);
    for(i=0; i<N; i++)
        cout << arr[i] << " ";
    cout << "\n";
	return 0;
}