c编写Iterative Mergesort

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

vasonv

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

阅读量1.2k

点赞数

分类专栏： ds

本文链接：https://blog.youkuaiyun.com/qq_31301089/article/details/57076384

版权

本文介绍了如何不使用递归的方式实现归并排序。通过从长度为1的N个已排序子列表开始，每次合并相邻的子列表，直到得到一个完整的有序列表。关键在于实现合并子列表的函数。

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

Iterative Mergesort (9分)

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.