二路归并排序算法的思想比较容易理解。

It is easy to understand the concept of 2-way merge sort algorithms.

youdao

给出了归并排序算法的一种改进算法，对具有“离散”性的多个数据排序时利用该算法具有较明显的优势。

This article has provided a kind of improved algorithm for merging sort, which has remarkable advantage in sorting a large amount of discrete data.

youdao

本文讨论超立方体结构上的并行归并排序算法，着重分析算法的通信复杂性，在此基础上推导算法的加速比。

This paper discusses the parallel merging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.

youdao

Well, we saw the teaser in terms of that animation that suggests this merge sort algorithm when implemented by a computer is absolutely faster.

我们从前面的动画中可以看到,这个归并排序算法在计算机上实现之后,绝对比其他算法更快。

哈佛公开课 - 计算机科学课程节选

If I'm using algorithm that I'm now calling merge sort, T the running time involved in sorting N elements, T of N, you know, is just the same as running the algorithm for the right half, plus what's this plus N come from?

如果我用归并排序算法，对N个元素其运行时间，就等于此算法一半元素的运行时间,另一半的运行时间，再加上N，这个N是什么呢？

哈佛公开课 - 计算机科学课程节选