归并排序(Merging Sort)就是利用归并的思想实现的排序算法。原理是假设初始序列含有n个记录,则可以看成是n个有序的子序列,每个子序列的长度为1,然后量...
基于282个网页-相关网页
This article has provided a kind of improved algorithm for merging sort, which has remarkable advantage in sorting a large amount of discrete data.
给出了归并排序算法的一种改进算法,对具有“离散”性的多个数据排序时利用该算法具有较明显的优势。
But because the merging is difficult to do in place, generally, it has higher memory requirements than in-place sort algorithms, such as quick-sort.
但是由于很难在原地进行合并,所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。
应用推荐