7-13 Insert or Merge

題目

題意： 判定給定序列是以何種排序方式排的，以及輸出下一步操作後的結果

tip：模擬+sort

#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int n, a[100], b[100], i, j;
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	for (int i = 0; i < n; i++)
		cin >> b[i];
	i=0;
	while(i<n-1)
		if(b[i] <= b[i + 1])
			i++;
		else break;
	for (j = i + 1; a[j] == b[j] && j < n; j++);
	if (j == n) {
		cout << "Insertion Sort\n";
		sort(a, a + i + 2);
	} else {//模擬歸併排序過程 
		cout << "Merge Sort\n";
		int k = 1, flag = 1;
		while(flag) {
			flag = 0;
			for (i = 0; i < n; i++) {
				if (a[i] != b[i])
					flag = 1;
			}
			k = k * 2;
			for (i = 0; i < n / k; i++)
				sort(a + i * k, a + (i + 1) * k);
			sort(a + n / k * k, a + n);
		}
	}
	for (j = 0; j < n; j++) {
		if (j != 0) printf(" ");
		printf("%d", a[j]);
	}
	return 0;
}