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

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