09-排序2 Insert or Merge（浙大数据结构）

09-排序2 Insert or Merge

分数 25

作者 陈越

单位 浙江大学

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

 solve one：

#include <iostream>
 
using namespace std;
 
const int maxn = 110;
int a[maxn],res[maxn];
int b[maxn];
 
int n;
int ans=0;
 
bool InsertSort(int *A,int num)
{
    for(int i=1;i<num;++i)
    {
        int temp=A[i],j;
        for(j=i;j>0 && A[j-1]>temp;--j)
        {
            A[j]=A[j-1];
        }
        A[j]=temp;
 
        int flag=0;
        for(int i=0;i<num;++i)
            if(res[i]==A[i])
                ++flag;
        if(flag==num)
        {
            if(i!=num-1)
            {
                ++i;
                int tem=A[i],j;
                for(j=i;j>0 && A[j-1]>tem;--j)
                {
                    A[j]=A[j-1];
                }
                A[j]=tem;
            }
            return true;
        }
    }
 
    return false;
}
 
void Merge(int *A,int l1,int r1,int l2,int r2)
{
    int tem[r2-l1+1];
    int index=0,l=l1;;
    while(l1<=r1 && l2<=r2)
    {
        if(A[l1]<=A[l2])
            tem[index++]=A[l1++];
        else
            tem[index++]=A[l2++];
    }
 
    while(l1<=r1)
        tem[index++]=A[l1++];
    while(l2<=r2)
        tem[index++]=A[l2++];
 
    for(int i=0;i<index;++i)
        A[i+l]=tem[i];
}
 
void MSort(int *A,int l,int r)  //MSort必须用迭代写法，用递归写法不能得到正确的序列
{
    int flag=0;
    for(int step=1;step<n;step+=step)
    {
        for(int i=l;(i+step)<=r;i+=step*2)
        {
            Merge(A,i,i+step-1,i+step,min(n-1,i+step*2-1));
        }
 
        if(flag==1)
            return;
 
        for(int i=0;i<n;++i)
        {
            if(A[i]==res[i])
                flag=1;
            else
            {
                flag=0;
                break;
            }
        }
    }
}
 
void MergeSort(int *A,int num)
{
    MSort(A,0,num-1);
}
 
int main()
{
    cin >> n;
    for(int i=0;i<n;++i)
    {
        cin >> a[i];
        b[i]=a[i];
    }
    for(int i=0;i<n;++i)
        cin >> res[i];
    if(InsertSort(a,n)==true)
    {
        puts("Insertion Sort");
        for(int i=0;i<n;++i)
        {
            if(i==0)
                cout << a[i];
            else
                cout << ' ' << a[i];
        }
        cout << endl;
    }
    else
    {
        puts("Merge Sort");
 
        MergeSort(b,n);
        for(int i=0;i<n;++i)
        {
            if(i==0)
                cout << b[i];
            else
                cout << ' ' << b[i];
        }
        cout << endl;
 
    }
 
    return 0;
}

solve two：

 
/**
// 用sort 替代Merge;
#include <iostream>
#include <algorithm>
 
using namespace std;
 
const int maxn = 110;
int a[maxn],res[maxn];
int b[maxn];
 
int n;
int ans=0;
 
bool InsertSort(int *A,int num)
{
    int flag=0;
    for(int i=1;i<num;++i)
    {
        int temp=A[i],j;
        for(j=i;j>0 && A[j-1]>temp;--j)
        {
            A[j]=A[j-1];
        }
        A[j]=temp;
 
        if(flag==1)
            return true;
 
        for(int i=0;i<num;++i)
        {
            if(res[i]==A[i])
                flag=1;
            else
            {
                flag=0;
                break;
            }
        }
    }
 
    return false;
}
 
 
void MSort(int *A,int l,int r)  //MSort必须用迭代写法，用递归写法不能得到正确的序列
{
    int flag=0;
    for(int step=1;step<=n;step+=step)
    {
        for(int i=l;(i+step)<=r;i+=step*2)
        {
            sort(A+i,A+min(i+step*2,n));
        }
 
        if(flag==1)
            return;
 
        for(int i=0;i<n;++i)
        {
            if(A[i]==res[i])
                flag=1;
            else
            {
                flag=0;
                break;
            }
        }
    }
}
 
void MergeSort(int *A,int num)
{
    MSort(A,0,num-1);
}
 
int main()
{
    cin >> n;
    for(int i=0;i<n;++i)
    {
        cin >> a[i];
        b[i]=a[i];
    }
    for(int i=0;i<n;++i)
        cin >> res[i];
    if(InsertSort(a,n)==true)
    {
        puts("Insertion Sort");
        for(int i=0;i<n;++i)
        {
            if(i==0)
                cout << a[i];
            else
                cout << ' ' << a[i];
        }
        cout << endl;
    }
    else
    {
        puts("Merge Sort");
 
        MergeSort(b,n);
        for(int i=0;i<n;++i)
        {
            if(i==0)
                cout << b[i];
            else
                cout << ' ' << b[i];
        }
        cout << endl;
 
    }
 
    return 0;
}
*/