PATA1089_排序模拟（难度：⭐️⭐️⭐️）

测试点5、6是merge。一开始我没有模拟归并排序，只是算间隔。这里会有一个问题，如果初始序列进行到某一步（本来间隔是4）但是恰好0 ～ 7（这里的间隔是8）刚好有序，那么就会出错，而且本来算间隔就会出错。

#include<bits/stdc++.h>
using namespace std;
vector<int> v, pre, aft, ans;
int main() {
    int n, flag = 0, pos;
    scanf ("%d", &n);
    pre.resize(n); aft.resize(n);
    for (int i = 0; i < n; i++) scanf ("%d", &pre[i]);
    for (int i = 0; i < n; i++) scanf ("%d", &aft[i]);
    v = pre;
    ans = aft;
    for (int i = 0; i < aft.size() - 1; i++) {
        if (aft[i] > aft[i + 1]) {
            pos = i + 1;
            break;
        }
    }
    sort(pre.begin(), pre.begin() + pos);
    for (int i = 0; i < pre.size(); i++) {
        if (pre[i] != aft[i]) {
            flag = 1;
            break;
        }
    }
    if (flag == 0) {
        sort(pre.begin(), pre.begin() + pos + 1);
        printf ("Insertion Sort\n");
        for (int i = 0; i < pre.size(); i++) {
            if (i != 0) printf (" ");
            printf ("%d", pre[i]);
        }
    }
    else {
        printf ("Merge Sort\n");
        int k = 1, flag = 1;
        while(flag) {
            flag = 0;
            for (int i = 0; i < n; i++) {
                if (v[i] != ans[i])
                    flag = 1;
            }
            k = k * 2;
            for (int i = 0; i < n / k; i++)
                sort(v.begin() + i * k, v.begin() + (i + 1) * k);
            sort(v.begin() + n / k * k, v.end());
        }
        for (int i = 0; i < aft.size(); i++) {
            if (i != 0) printf (" ");
            printf ("%d", v[i]);
        }
    }
}