数据结构基础之迭代法归并排序

6-1 Iterative Mergesort (7 分)

How would you implement mergesort without using recursion?

The idea of iterative mergesort is to start from N sorted sublists of length 1, and each time to merge a pair of adjacent sublists until one sorted list is obtained. You are supposed to implement the key function of merging.

Format of functions:

void merge_pass( ElementType list[], ElementType sorted[], int N, int length );

The function merge_pass performs one pass of the merge sort that merges adjacent pairs of sublists from list into sorted. N is the number of elements in the list and length is the length of the sublists.

Sample program of judge:

#include <stdio.h>

#define ElementType int
#define MAXN 100

void merge_pass( ElementType list[], ElementType sorted[], int N, int length );

void output( ElementType list[], int N )
{
    int i;
    for (i=0; i<N; i++) printf("%d ", list[i]);
    printf("\n");
}

void  merge_sort( ElementType list[],  int N )
{
    ElementType extra[MAXN];  /* the extra space required */
    int  length = 1;  /* current length of sublist being merged */
    while( length < N ) { 
        merge_pass( list, extra, N, length ); /* merge list into extra */
        output( extra, N );
        length *= 2;
        merge_pass( extra, list, N, length ); /* merge extra back to list */
        output( list, N );
        length *= 2;
    }
} 


int main()
{
    int N, i;
    ElementType A[MAXN];

    scanf("%d", &N);
    for (i=0; i<N; i++) scanf("%d", &A[i]);
    merge_sort(A, N);
    output(A, N);

    return 0;
}

/* Your function will be put here */

Sample Input:

10
8 7 9 2 3 5 1 6 4 0

Sample Output:

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

Solution:

void merge_pass(ElementType list[],ElementType sorted[],int N,int length)
{
    int l,left,right,start;
    start=0;
    for(l=0;l<N;)
    {
        left=l;
        right=l+length;
        while(right<l+2*length&&left<length+l&&left<N&&right<N)
        {
            if(list[left]<list[right])
                {
                    sorted[start]=list[left];
                    left=left+1;
                    start=start+1;
                }
            else
                {
                   sorted[start]=list[right];
                   right=right+1; 
                   start=start+1;
                }
        }
        
       for(;left<N&&left<length+l;)
        {
            sorted[start]=list[left];
            start=start+1;
            left=left+1;
        }
        for(;right<N&&right<length*2+l;)
        {
            sorted[start]=list[right];
            start=start+1;
            right=right+1;
        }
        l=l+2*length;
    }
}