6-2 Iterative Mergesort

最新推荐文章于 2023-12-31 12:03:02 发布

星空不见云

最新推荐文章于 2023-12-31 12:03:02 发布

阅读量831

点赞数 1

文章标签：数据结构排序算法

本文链接：https://blog.csdn.net/weixin_52649939/article/details/124591821

版权

该博客介绍了一种不使用递归的迭代方法来实现归并排序。通过不断合并相邻的子列表，直到得到一个完全排序的列表。提供的示例程序展示了如何在C语言中实现这个过程，并给出了输入和输出示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

我的代码为：

void merge_pass( ElementType list[], ElementType sorted[], int N, int length )
{
   int m=0,i=0,j=i+length;
   int flag1,flag2;
   while(i<N)
   {
       flag1=j;
       flag2=i+2*length;
       while(i<flag1&&j<flag2&&j<N)
       {
         if(list[i]<=list[j])
            sorted[m++]=list[i++];
         else
            sorted[m++]=list[j++];
       }
       while(i<flag1)
          sorted[m++]=list[i++];
       while(j<flag2&&j<N)
           sorted[m++]=list[j++];
       i=flag2;
       j=i+length;
   }
}