·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
In Listing 2, I use a classical merge algorithm to merge the lists from both documents.
在清单2中,我使用传统的合并算法合并来自两个文档中的列表。
Put forward the avoidance-merge algorithm (A-M algorithm) and has given an example.
提出了回避-归并算法,并给出了一个例子。
To avoid memory access conflict, the algorithms are based on a parallel merge algorithm.
为了避免存储访问冲突,算法采用了基于并行归并的并行排序方法。
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是什么呢?
应用推荐