MergeSort

#include <iostream>
#include <sstream>
#include <stdexcept>
#include <string>
#include <vector>
#include <queue>

using namespace::std;

void merge(int n, int arr[], int L, int R) {
    int very_min = arr[0];
    while (1) {
        break;
    }
    for (int i = 0; i < 10; ++i) {
        cout << arr[i] << " ";
    }
}

int main(){
    int a[10];
    for (int i = 10;  i > 0; i--) {
        a[10 -  i] = i;
    }
    int *ptr = a;
    merge(10, ptr, 0, 4);
}