Insert or Merge (25分)【C语言】

习题讲解视频

题目：

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?

输入格式

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.

输出格式

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 resuling 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.

输入样例

10
3 1 2 8 7 5 9 4 6 0
1 2 3 7 8 5 9 4 6 0

输出样例

Insertion Sort
1 2 3 5 7 8 9 4 6 0

输入样例

10
3 1 2 8 7 5 9 4 0 6
1 3 2 8 5 7 4 9 0 6

输出样例

Merge Sort
1 2 3 8 4 5 7 9 0 6

算法

问题分析

• 如何区分插入排序和非递归的归并排序
• 非递归排序如何确定当前有序子列的长度
  
  

代码实现

#define ASCENDING(a,b) (a<b?1:0)
typedef int ElementType;
int main()
{	
	int N;
	scanf("%d",&N);
	ElementType * A=(ElementType*)malloc(sizeof(ElementType)*N);
	ElementType * B=(ElementType*)malloc(sizeof(ElementType)*N);
	int i;
	for(i=0;i<N;i++){
	    scanf("%d",&(A[i]));
	}
	for(i=0;i<N;i++){
	    scanf("%d",&(B[i]));
	}
	int Is=IsInsertion(A,B,N);//判断是否是插入排序。0代表是归并排序
	if(Is){
	    int Temp=B[Is];//进行一步插入
	    for(i=Is;i>0&&(B[i-1]>Temp);i--){
	        B[i]=B[i-1];
	    }
	    B[i]=Temp;
	    printf("Insertion Sort\n");
	}else{
	    int len=Length(B,N);//计算归并排序的有序子列长度
	    MergePass(B,N,len);//再进行一趟归并
	    printf("Merge Sort\n");
	}
	for(i=0;i<N;i++){
	    printf("%ld",B[i]);
	    if(i!=N-1){
	        printf(" ");
	    }
	}
	return 0;
}
		

MergePass函数：一趟归并排序

void MergePass(ElementType A[],int N,int len)
{
	ElementType* Temp=(ElementType*)malloc(sizeof(ElementType)*N);
	int i;
	for(i=0;i<=N-2*len;i+=2*len){
	    Merge(A,Temp,i,i+len,i+2*len-1);
	}
	if(i+len<N){
	    Merge(A,Temp,i,i+len,N-1);
	}else{
	    for(;i<N;i++){
	        Temp[i]=A[i];
	    }
	}
	for(i=0;i<N;i++){
	    A[i]=Temp[i];
	}
} 

Merge函数：归并核心代码

void Merge(ElementType A[],ElementType TmpA[],int L,int R,int RightEnd)
{
	int LeftEnd=R-1;
	int Num=RightEnd-L+1;
	int T=L;
	while(L<=LeftEnd&&R<=RightEnd){
	    if(A[L]<A[R]){
	        TmpA[T++]=A[L++];
	    }else{
	        TmpA[T++]=A[R++];
	    }
	}
	for(;L<=LeftEnd;TmpA[T++]=A[L++]);
	for(;R<=RightEnd;TmpA[T++]=A[R++]);
}		

Length函数：计算当前序列的有序长度

int Length(ElementType B[],int N)
{
	int len;
	int i;
	int flag=1;
	for(len=2;len<N;len*=2){
	    i=-1;
	    for(i+=len;i<N-1;i+=2*len){
	        if(!ASCENDING(B[i],B[i+1])){
	            flag=0;
	            break;
	        }
	    }
	    if(flag==0)break;
	}
	return len;
} 

IsInsertion函数：判断是否是插入函数

int IsInsertion(ElementType A[],ElementType B[],int N)
{
	int i;
	int ret=0;
	for(i=1;i<N;i++){
	    if(B[i]<B[i-1]){
	        ret=i;
	        break;
	    }
	}
	for(i=ret;i<N;i++){
	    if(A[i]!=B[i]){
	        ret=0;
	    }
	}
	return ret;
}