但是由于很难在原地进行合并，所以合并排序的内存需求比能够原地进行的排序算法(例如快速排序)更高。

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.

youdao

将内部缓冲技术、浮洞技术与分治技术相结合，提出了一种快速线性原地二路归并算法。

By combining the internal buffering technique and the float hole technique with the divide-and-conquer technique, a fast linear-time in-place 2-way merge algorithm is introduced in the paper.

youdao

将内部缓冲技术、浮洞技术与分治技术相结合，提出了一种快速线性原地二路归并算法。

By combining the internal buffering technique and the float hole technique with the divide-and-conquer technique, a fast linear-time in-place 2-way merge algorithm is introduced in the paper.

youdao