MergeSort

template<typename Container>
void UserSort(Container& con) {
    for (int i = 0; i < con.size(); ++i) {
        for (int j = 0; j < con.size() - 1 - i; ++j) {
            if (con[j + 1] < con[j]) {
                swap(con[j], con[j +1]);
            }
        }
    }
}

template<typename RandomIt>
void MergeSort(RandomIt& first, RandomIt& last) {
    auto base_v = MakeVector(first, last);

    RandomIt middle = first + (last - first) / 2;
    auto lhs = MakeVector(first, middle);
    auto rhs = MakeVector(middle, last);

    UserSort(lhs);
    UserSort(rhs);

    decltype(lhs) b;
    merge(lhs.begin(), lhs.end(), rhs.begin(), rhs.end(), back_inserter(b));

}