09-排序2 Insert or Merge (25分)

#include <stdio.h>
#include <stdlib.h>

void Merge(int a[], int temp[], int ll, int rl, int rh) {
    int lh = rl-1, length = rh-ll+1, tl = ll;
    while(ll <= lh && rl <= rh) {
        if(a[ll] <= a[rl]) temp[tl++] = a[ll++];
        else temp[tl++] = a[rl++];
    }
    while(ll <= lh) temp[tl++] = a[ll++];
    while(rl <= rh) temp[tl++] = a[rl++];
}

void Merge_Pass(int a[], int temp[], int n, int len) {
    int i, j;
    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(j = i; j < n; j++) temp[j] = a[j];
}

int Judge(int a[], int b[], int n) {
    int i, flag = 1;
    for(i = 0; i < n; i++)
        if(a[i] != b[i]) flag = 0;
    return flag;
}

int Merge_Sort (int a[], int b[], int n){
    int temp[105], len = 1, flag = 0;
    while(len < n) {
        Merge_Pass(a, temp, n, len);
        len *= 2;
        if(Judge(temp, b, n)) flag = 1;
        else if(flag) break;
        Merge_Pass(temp, a, n, len);
        len *= 2;
        if(Judge(a, b, n)) flag = 1;
        else if(flag) break;
    }
    return flag;
}

void Insertion_Sort(int a[], int b[], int n) {
    int i, j, temp, flag = 0;
    for(i = 1; i < n; i++) {
        temp = a[i];
        for(j = i; j > 0 && a[j-1] > temp ; j--) a[j] = a[j-1];
        a[j] = temp;
        if(Judge(a, b, n)) flag = 1;
        else if(flag) return;
    }
}

int main() {
    int n, i, a[105], b[105], t[105], flag = 1;
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    scanf("%d", &n);
    for(i = 0; i < n; i++) { scanf("%d", &a[i]); t[i] = a[i]; }
    for(i = 0; i < n; i++) scanf("%d", &b[i]);
    if(Merge_Sort(a, b, n)) {
        printf("Merge Sort\n");
        for(i = 0; i < n; i++) {
            if(flag) flag = 0;
            else printf(" ");
            printf("%d", a[i]);
        }
    }
    else {
        Insertion_Sort(t, b, n);
        printf("Insertion Sort\n");
        for(i = 0; i < n; i++) {
            if(flag) flag = 0;
            else printf(" ");
            printf("%d", t[i]);
        }
    }
    return 0;
}