#include <iostream>

using namespace std;

void merge_sort(int v[], int st, int dr)
{
    if(st == dr)
        return;
    int mid = (st + dr) / 2;
    merge_sort(v, st, mid);
    merge_sort(v, mid+1, dr);
    // interclasam v[st], ..., v[mid]
    // cu v[mid+1], ..., v[dr]
}

int main()
{
    int v[] = {2, 1, 3, 4, 5, 1, 6, 8, 2, 1, 7, 3};
    merge_sort(v, 0, 11);
    for(int i = 0; i < 11; i++)
        cout << v[i] << " ";
    return 0;
}