片语

merge and merge-sort归并和归并排序

merge exchange sort[计]

merge e sort归并分类

balanced merge-sort program均衡归并分类程序

merge e exchange sort归并交换分类

bitonic merge sort双调归并排序

oscillating merge sortOscillating merge sort or oscillating sort is a variation of merge sort used with tape drives that can read backward Instead of doing a complete distribution as is done in a tape merge, the distribution of the input and the merging of runs are interspersed.

merge w sort归并分类

英汉例句

• for example, implement merge sort

  例如，如何实现合并排序。

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

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

• merge sort has o(n log n) worst-case and average-case performance.

  合并排序的最差性能和平均性能为o(nlogn)。

• let「s do selection and let」s do merge sort here on the right just to see what actually happens.

  中间进行选择排序，右边进行归并排序，看看会发生什么。

• we also give the key algorithms included in the search engine: the word split algorithm, the merge sort algorithm and the large file processing technology.

  给出搜索引擎中包含的关键技术算法：分词技术、多路归并算法和大文件处理技术；

• i gave him a thumbnail sketch of how to implement a merge sort on disk.

  对他怎样在一个磁盘上执行合并分检我嗤之以鼻。

• we like the simple answer two readers came up with: merge sort for sorting.

  目的是考察被面试者的创造性。我们倾向于两位读者给出的简单答案：用归并排序法（merge sort）排序。

• let「s run merge sort on it, and then we」ll look at the code.

  让我们在这个列表上运行归并排序，然后我们在看一下代码。

• emad omara’s parallel merge sort algorithm assumes that you will have full access to the machine’s cpus for the duration of the sorting operation.

  emadomara的并行合并排序算法假设了在排序操作的过程中（操作者）对计算机的所有cpu具有完全的访问权限。

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

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

• run merge sort on those. by induction, if it does the right thing, i「m going to get back two lists, and i」m going to then merge them together. notice what i「m going to do.

  在这些上面再运行归并排序，根据归纳，如果这样是正确的，我将重新得到两个列表，然后我会把它们合并在一起。

• merge sort takes this idea of divide and conquer, and it does the following: it says let」s divide the list in half.

  归并排序以如下的步骤使用了分治思想：，把列表分成两半：，下面就是分治。