数据结构01- 09-排序2 Insert or Merge

 

 

#include<stdio.h>
#define MAXN 102
int n,a[MAXN],p[MAXN],A[MAXN];
void read();
int insertion_sort();
void merge_sort();
void merge_pass(int a[],int tmpa[],int n,int length);
void merge(int a[],int tmpa[],int l,int r,int rend);
void print(int a[]);
int test(int a[],int b[]);
void init();
int main(){
    read();
    if(insertion_sort()==0) {init();merge_sort();}
    return 0;
}
void init(){
    for(int i=0;i<n;i++){
        a[i] = A[i];
    }
}
void read(){
    scanf("%d",&n);
    for(int i=0;i<n;i++) {scanf("%d",&a[i]); A[i] = a[i];}
    for(int i=0;i<n;i++) scanf("%d",&p[i]);
}
void print(int a[]){
    for(int i=0;i<n;i++){
        printf("%d",a[i]);
        if(i!=n-1) printf(" ");
    }
    printf("\n");
}
int test(int a[],int b[]){
    for(int i=0;i<n;i++)
        if(a[i]!=b[i]) return 0;
    return 1;
}
int insertion_sort(){
    int i,j,flag=0,value;
    for(i=1;i<n;i++){
        value = a[i];
        for(j=i;a[j-1]>value && j>0;j--)
            a[j] = a[j-1];
        a[j] = value;
        if(flag==1)
        {
             printf("Insertion Sort\n");
             print(a);
            return 1;
        }
        flag = test(a,p);          
    }
    return 0;
}
void merge_sort(){
    int length=1,flag=0;
    int tmpa[MAXN];
    while(length<n){
        merge_pass(a,tmpa,n,length);
        if(flag==1) {printf("Merge Sort\n");print(tmpa); return;}
        flag = test(tmpa,p);
        length *= 2;
        merge_pass(tmpa,a,n,length);
        if(flag==1) {printf("Merge Sort\n");print(a);return;}
        flag = test(tmpa,p);
    }
}
void merge_pass(int a[],int tmpa[],int n,int length){
    int i;
    for( i=0;i<=n-2*length;i+=2*length){
        merge(a,tmpa,i,i+length,i+2*length-1);
    }
    if(i+length>=n){
        for(int j=i;j<n;j++) tmpa[j] = a[j];
    }
    else{
        merge(a,tmpa,i,i+length,n-1);
    }
}
void merge(int a[],int tmpa[],int l,int r,int rend){
    int tmpl = l;
    int le = r-1;
    while(l<=le&&r<=rend){
        if(a[l]>a[r]) {tmpa[tmpl++] = a[r]; r++;}
        else if(a[l]<a[r]){tmpa[tmpl++] = a[l];l++;}
        else {tmpa[tmpl++] = a[l]; tmpa[tmpl++] = a[r];l++;r++;}
    }
    while(l<=le){
        tmpa[tmpl++] = a[l];
        l++;
    }
    while(r<=rend){
        tmpa[tmpl++] = a[r];
        r++;
    }

}