go top 返回词典
• 20 minutes: Coding question. For example, implement merge sort

接下来的20分钟编程问题例如如何实现合并排序

article.yeeyan.org

• We like the simple answer two readers came up with: Merge Sort for sorting.

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

article.yeeyan.org

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

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

dict.youdao.com

• OK, what I would like you to see is I've been printing out, as I went along, actually let's back up slightly and look at the code. There's merge sort.

好的你们就是运行过后,打印出来的结果，我们再回头一下段代码,就是归并排序，输入一个列表。

v.163.com

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

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

dict.youdao.com

• 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.

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

dict.youdao.com

• A method of sorting particles based on the parallel sorting algorithm "odd-even merge sort"has been proposed.

提出了一种使用-偶合排序”来进行高效的粒子距离排序方法

dict.cnki.net

• Merge Sort.

归并排序

v.163.com

• 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.

给出搜索引擎包含关键技术算法技术、多路归并算法文件处理技术

dict.cnki.net

• Merge sort has O(n log n) worst-case and average-case performance.

合并排序最差性能平均性能O(nlogn)。

www.ibm.com

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

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

www.dictall.com

• For example, implement merge sort

例如如何实现合并排序

article.yeeyan.org

• 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.

www.infoq.com

• Use merge sort, in a binary search algorithm complexity: nlogn, n number two together, if can equal to a specific number m, the output yes, otherwise no output.

说明：运用归并排序二分查找算法复杂度nlognn个数两两相加，等于特定m，则输出yes否则输出no

www.ymcn.org

• Let's run merge sort on it, and then we'll look at the code.

我们这个列表上运行归并排序然后我们一下代码

v.163.com

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

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

dict.youdao.com

• I gave him a thumbnail sketch of how to implement a Merge Sort on disk.

怎样一个磁盘执行合并分检嗤之以鼻

danci.911cha.com

• This paper considers SQL Group-By and aggregation based on merge-sort in parallel database systems.

本文考虑并行数据库系统基于归并排序分组操作函数计算。

dict.cnki.net

• Perhaps your organization's habit with PDF is to have someone adept with a particular desktop word processor set up a "mail merge" sort of operation to parameterize document output.

组织处理PDF惯例可能熟练掌握特定桌面处理程序某个人建立某种类似邮件合并操作使文档输出参数化

www.ibm.com

• Merge-sort is not an inherently parallel algorithm, as it can be done sequentially, and is popular when the data set is too large to fit in memory and must be sorted in pieces.

合并排序本身并非并行算法因为可以顺序执行数据内存无法容纳必须分片保存的时候经常使用合并排序

www.ibm.com

• Listing 1. Merge-sort using the fork-join library

清单1.使用fork-join进行合并排序

www.ibm.com

• Join plan directives that force optimizer to use the designated join method to join tables in the query, either nested loop join, sort merge join, or dynamic hash join.

连接计划指示强制优化使用指定连接方法连接查询中的要么嵌套循环连接分类合并连接要么动态哈希连接

www.ibm.com

• The most commonly used join methods are nested-loop join, sort merge join and dynamic hash join.

常用连接方法就是循环连接分类合并连接动态哈希连接

www.ibm.com

• Also, DB2 cannot use random order index columns as part of a sort merge join.

另外DB2无法排序合并合并连接使用随机顺序索引

www.ibm.com

• A hash join is usually faster than a sort merge join since there is no sort operation involved.

连接通常分类合并连接因为没有涉及到分类操作

www.ibm.com

• If the query includes a join, the optimizer must determine the join plan (hash, sort merge, or nested loop), and the order in which tables are evaluated or joined.

如果查询包含连接那么优化器就必须确定连接计划hashsort mergenestedloop），以及评估连接次序

www.ibm.com

• In the case of the UnionExpression class, the evaluate() method evaluates the two operands, checks that the result is in both cases a node-set, and then forms the union using a sort-merge strategy.

如果UnionExpressionevaluate()方法两个操作数求值，检查这两种情况下节点结果然后使用排序合并策略组成联合

www.ibm.com

• If the sort_merge_passes status variable is high, this is an indication of this disk activity.

如果 sort_merge_passes状态变量很大指示磁盘活动情况。

www.ibm.com

• The sort command can also merge already sorted files and check whether a file is sorted or not.

sort命令可以合并已经排序文件检查某个文件是否已经排序

www.ibm.com

• Increasing the sort heap may eliminate the merge phases, hence the improvement in sort time.

排序增加可能会消除合并阶段因而减少排序时间

www.ibm.com

\$firstVoiceSent
- 来自原声例句