1089 Insert or Merge (25 分)

非原创，参考：https://blog.csdn.net/richenyunqi/article/details/81150510

#pragma warning(disable:4996)
#define _CRT_SECURE_NO_WARNINGS

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cmath>
#include <string>
#include <cstring>
#define INFINITE 2000000000
using namespace std;


int main() {
    int n;
    cin >> n;
    int v1[110], v2[110], A[110];
    for (int i = 0; i < n; ++i) cin >> v1[i];
    for (int i = 0; i < n; ++i) cin >> v2[i];
    int flag = 0;
    memcpy(A, v1, sizeof(int) * n);
    for (int i = 1; i < n; ++i) {
        sort(A, A + i + 1);
        if(equal(A, A+n, v2)){
            sort(A, A + i + 2);
            flag = 1;
            cout << "Insertion Sort" << endl;
            break;
        }
    }
    if (!flag) {
        cout << "Merge Sort" << endl;
        memcpy(A, v1, sizeof(int)*n);//每step个元素排序
        for (int step = 2; step < n; step *= 2) {
            for (int i = 0; i < n; i+=step) {
                sort(A + i, A + min(i + step, n));
            }
            if (equal(A, A + n, v2)) {
                for (int i = 0; i < n; i+=step*2) 
                    sort(A + i, A + min(i + step*2, n));
                break;
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        if (i != 0) cout << " ";
        cout << A[i];
    }
    return 0;
}