According to Wikipedia:
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.
Merge sort works as follows: Divide the unsorted list into N sublists, each containing 1 element (a list of 1 element is considered sorted). Then repeatedly merge two adjacent sublists to produce new sorted sublists until there is only 1 sublist remaining.
Now given the initial sequence of integers, together with a sequence which is a result of several iterations of some sorting method, can you tell which sorting method we are using?
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=100). Then in the next line, N integers are given as the initial sequence. The last line contains the partially sorted sequence of the N numbers. It is assumed that the target sequence is always ascending. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print in the first line either "Insertion Sort" or "Merge Sort" to indicate the method used to obtain the partial result. Then run this method for one more iteration and output in the second line the resulting sequence. It is guaranteed that the answer is unique for each test case. All the numbers in a line must be separated by a space, and there must be no extra space at the end of the line.
Sample Input 1:10 3 1 2 8 7 5 9 4 6 0 1 2 3 7 8 5 9 4 6 0Sample Output 1:
Insertion Sort 1 2 3 5 7 8 9 4 6 0Sample Input 2:
10 3 1 2 8 7 5 9 4 0 6 1 3 2 8 5 7 4 9 0 6Sample Output 2:
Merge Sort 1 2 3 8 4 5 7 9 0 6
思路分析:直接模拟两个排序的过程,每进行一趟排序判断是否符合目标数组。是其中一个,再进行下一趟排序输出结果。我这里的归并排序中间利用了标准库中的sort,不是从零实现的,但和归并排序思路完全一样。
#include <cstdio>
#include <algorithm>
#define MAX 100
using namespace std;
int initA[MAX];
int initB[MAX];
int targetA[MAX];
bool flag = false;
bool temp = false;
void Print( int n, int init[] ) {
for( int i = 0; i < n; i++ ) {
if( i == 0 ) printf( "%d", init[i] );
else printf( " %d", init[i] );
}
printf( "\n" );
}
bool judge( int n, int init[] ) {
for( int i = 0; i < n; i++ ) {
if( init[i] != targetA[i] ) {
return false;
}
}
return true;
}
void isInsertSort( int n ) {
for( int i = 1; i < n; i++ ) {
int curNum = initA[i];
int index = i;
for( int j = 0; j < i; j++ ) {
if( initA[j] > curNum ) {
index = j;
break;
}
}
for( int end = i; end > index; end-- ) {
initA[end] = initA[end - 1];
}
initA[index] = curNum;
//Print( n );
if( flag ) break;
if( judge( n, initA ) ) {
flag = true;
}
}
}
void mergeSort( int n ) {
int step = 2; // 先从2个单位开始排序
while( step <= n ) {
for( int i = 0; i < n; i += step ) {
int begin = i;
int end = i + step;
if( end > n ) end = n; // 考虑到如果单位组末尾超过数组范围
sort( initB + begin, initB + end );
}
if( temp ) break;
if( judge( n, initB ) ) {
temp = true;
}
step *= 2; // 扩大单位范围,每次乘2
}
}
int main() {
int N;
scanf( "%d", &N );
for( int i = 0; i < N; i++ ) {
scanf( "%d", &initA[i] );
initB[i] = initA[i];
}
for( int i = 0; i < N; i++ ) {
scanf( "%d", &targetA[i] );
}
isInsertSort( N );
mergeSort( N );
if( flag ) {
printf( "Insertion Sort\n" );
Print( N, initA );
}
else if( temp ){
printf( "Merge Sort\n" );
Print( N, initB );
}
return 0;
}