Insert or Merge && Insertion or Heap Sort

原题连接：https://pta.patest.cn/pta/test/1342/exam/4/question/27102

题目如下：

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 NNN (≤100le 100≤100). Then in the next line, NNN integers are given as the initial sequence. The last line contains the partially sorted sequence of the NNN 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 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.

Sample Input 1:

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

Sample Output 1:

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

Sample Input 2:

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

Sample Output 2:

Merge Sort
1 2 3 8 4 5 7 9 0 6
______________________________________________________________________________________________________________________________________________________________________________
　　感觉这道题目的题意比较理解，两种排序方法，但给出的样例是排序到其中某一排序的中间一步，至于是哪一步，还得自己写程序判断。以下是代码，其中某些地方也借鉴了其他人的写法，但记不清是哪位同学的了……

#include<stdio.h>
#define Max 105
int IsSort(int *a,int *b,int N)
{
    int i;
    for (i=0;i<N;i++)
    {
        if (a[i]!=b[i])return 0;
    }
    return 1;
}

void InsertSort(int A[],int p)
{
    int tmp=A[p];
    int i;
    for (i=p;i>0 && A[i-1]>tmp;i--)A[i]=A[i-1];
    A[i]=tmp;
}

void Merge(int A[],int tmpA[],int L,int R,int RightEnd)
{
    int LeftEnd,Number,tmp,i;
    LeftEnd=R-1;
    Number=RightEnd-L+1;
    tmp=L;
    while (L<=LeftEnd && R<=RightEnd)
    {
        if (A[L]<=A[R])tmpA[tmp++]=A[L++];
        else tmpA[tmp++]=A[R++];
    }
    while (L<=LeftEnd)tmpA[tmp++]=A[L++];
    while (R<=RightEnd)tmpA[tmp++]=A[R++];
    for (i=0;i<Number;i++,RightEnd--)
    {
        A[RightEnd]=tmpA[RightEnd];
    }

}

void MSort(int A[],int tmpA[],int length,int N)
{
    int i,j;
    for (i=0;i<=N-2*length;i+=2*length)
    {
        Merge(A,tmpA,i,i+length,i+2*length-1);
    }
    if (i+length<N)Merge(A,tmpA,i,i+length,N-1);

}

void pri(int *a,int N)
{
    int i;
    for (i=0;i<N;i++)
    {
        if (i==0)printf("%d",a[i]);
        else printf(" %d",a[i]);
    }

}
int main()
{
    int N,a1[Max],a2[Max],b[Max],tmpA[Max],i,v;
    scanf("%d",&N);
    for (i=0;i<N;i++)
    {
        scanf("%d",&v);
        a1[i]=a2[i]=v;
    }
    for (i=0;i<N;i++)scanf("%d",&b[i]);

    for (i=1;i<N;i++)
    {
        InsertSort(a1,i);
        if (IsSort(a1,b,N))
        {
            printf("Insertion Sort
");
            InsertSort(a1,i+1);
            pri(a1,N);
            return 0;
        }
    }

    int length=1;
    while (length<N){
        MSort(a2,tmpA,length,N);
        length*=2;
        if (IsSort(a2,b,N))
        {
            printf("Merge Sort
");
            MSort(a2,tmpA,length,N);
            pri(a2,N);
            return 0;
        }
    }

}

 ________________________________________________________________________________________________________________________

接下来还有一道题和该题类似，只不过把归并排序换成了堆排序

#include<stdio.h>
#define Max 100
int IsSort(int *a,int *b,int N)
{
    int i;
    for (i=0;i<N;i++)
    {
        if (a[i]!=b[i])return 0;
    }
    return 1;
}

int InsertionSort(int *a,int p)
{
    int i,tmp;
    tmp=a[p];
    for (i=p;i>0 && a[i-1]>tmp ;i--)
    {
        a[i]=a[i-1];
    }
    a[i]=tmp;
}

void Swap(int *a,int *b)
{
    int tmp;
    tmp=*a;*a=*b;*b=tmp;
}

void PercDown(int *a,int p,int N)
{
    int tmp,Child,Parent;
    tmp=a[p];
    for (Parent=p;Parent*2+1<N;Parent=Child)
    {
        Child=Parent*2+1;
        if ((Child!=N-1) && (a[Child+1]>a[Child]))Child++;
        if (tmp>=a[Child])break;
        else a[Parent]=a[Child];
    }
    a[Parent]=tmp;
}

/* void HeapSort(int *a,int N)
{
    int i;
    for (i=N/2-1;i>=0;i--)PercDown(a,i,N);
    for (i=N-1;i>0;i--)
    {Swap(&a[0],&a[i]);
    PercDown(a,0,i);}
} */

void Pri(int *a,int N)
{
    int i;
    for (i=0;i<N;i++)
    {
        if (i==0)printf("%d",a[i]);
        else printf(" %d",a[i]);
    }
}

int main()
{
    int i,N,a1[Max],a2[Max],b[Max],v;
    scanf("%d",&N);
    for (i=0;i<N;i++)
    {
        scanf("%d",&v);
        a1[i]=a2[i]=v;
    }
    for (i=0;i<N;i++)scanf("%d",&b[i]);

    for (i=0;i<N;i++)
    {
        InsertionSort(a1,i);
        if (IsSort(a1,b,N))
        {
            printf("Insertion Sort
");
            InsertionSort(a1,++i);
            Pri(a1,N);
            return 0;
        }
    }

    for (i=N/2-1;i>=0;i--)PercDown(a2,i,N); //Build the Heap;

    for (i=N-1;i>0;i--)
    {
        Swap(&a2[0],&a2[i]);
        PercDown(a2,0,i);
        if (IsSort(a2,b,N))
        {
        printf("Heap Sort
");
        Swap(&a2[0],&a2[--i]);
        PercDown(a2,0,i);
        Pri(a2,N);
            return 0;
        }
        else printf("df");
    }
}