PAT A1089 Insert or Merge

难题 搞了好久

#include<cstdio> 
#include<algorithm>
using namespace std;
const int N = 111;
int origin[N],tempOri[N],changed[N];
int n;
bool isSame(int A[],int B[]){
	for(int i=0;i<n;i++){
		if(A[i] != B[i]) return false;
	}
	return true;
}

bool showArray(int A[]){
	for(int i=0;i<n;i++){
		printf("%d",A[i]);
		if(i < n-1) printf(" ");
	}
	printf("\n");
}

bool insertSort(){
	bool flag = false;
	for(int i=1;i<n;i++){
		if( (i != 1) && (isSame(tempOri,changed)) ) flag = true;
		int temp = tempOri[i], j = i;
		while( (j > 0) && (tempOri[j-1] > temp)){
			tempOri[j] = tempOri[j-1];
			j--;
		}
		tempOri[j] = temp;
		if(flag == true) return true;
	}
	return false;
}

void mergeSort(){
	bool flag = false;
	for(int step = 2; (step / 2) <= n; step *= 2){
		if((step != 2) && isSame(tempOri,changed)) flag = true;
		for(int i=0;i<n;i += step){
			sort(tempOri+i,tempOri+min(i+step,n));
		}
		if(flag == true){
			showArray(tempOri);
			return;
		}
	}
}

int main() {
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&origin[i]);
		tempOri[i] = origin[i];
	}
	for(int i=0;i<n;i++){
		scanf("%d",&changed[i]);
	}
	if(insertSort()){
		printf("Insertion Sort\n");
		showArray(tempOri);
	}
	else{
		printf("Merge Sort\n");
		for(int i=0;i<n;i++){
			tempOri[i] = origin[i];
		}
		mergeSort();
	}
	return 0;
}