For example, implement merge sort.
例如，如何实现合并排序。
Let's run merge sort on it, and then we'll look at the code.
让我们在这个列表上运行归并排序，然后我们在看一下代码。
20 minutes: Coding question. For example, implement merge sort.
接下来的20分钟：编程的问题。例如，如何实现合并排序。
Merge sort has o (n log n) worst-case and average-case performance.
合并排序的最差性能和平均性能为o (nlog n)。
It is easy to understand the concept of 2-way merge sort algorithms.
二路归并排序算法的思想比较容易理解。
Let's do selection and let's do merge sort here on the right just to see what actually happens.
中间进行选择排序，右边进行归并排序，看看会发生什么。
Merge sort takes this idea of divide and conquer, and it does the following: it says let's divide the list in half.
归并排序以如下的步骤使用了分治思想：，把列表分成两半：，下面就是分治。
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具有完全的访问权限。
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.
说明：运用归并排序，在用二分法查找，算法复杂度：nlogn，n个数两两相加，若能等于特定数m，则输出yes，否则输出no。
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.
在这些上面再运行归并排序，根据归纳，如果这样是正确的，我将重新得到两个列表，然后我会把它们合并在一起。
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.
连接计划指示，强制优化器使用指定的连接方法来连接查询中的表，要么是嵌套循环连接、分类合并连接，要么是动态哈希连接。
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的惯例可能是：让熟练掌握特定桌面字处理程序的某个人建立某种类似“邮件合并”的操作，使文档输出参数化。
The most commonly used join methods are nested-loop join, sort merge join and dynamic hash join.
最常用的连接方法就是嵌套循环连接、分类合并连接和动态哈希连接。
Also, DB2 cannot use random order index columns as part of a sort merge join.
另外，DB 2无法在排序合并合并连接中使用随机顺序的索引列。
A hash join is usually faster than a sort merge join since there is no sort operation involved.
哈希连接通常比分类合并连接快，因为它没有涉及到分类操作。
Merge scan join (MSJOIN) with sort for outer and inner
使用内部和外部排序的合并扫描联接 (MSJOIN)
In fact they must release energy in that way in order to degrade their orbits and get close enough to merge. Those gravitational waves could act sort of like a jet engine, explained Jonker.
Jonker解释道，“事实上他们必须通过这种方式来释放能量，降低轨道，彼此靠近并最终融合，这些重力波能产生类似喷气发动机的效果。”
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.
合并排序本身并非并行算法，因为它可以顺序执行。当数据集太大，内存无法容纳，必须分片保存的时候，经常使用合并排序。
Wow I can sort two lists, so I can merge two lists.
喔，我可以，将两个列表排好序。
If your timestamps are to the nanosecond, you can re-merge these files together and usually not lose the order of events ("sort -m").
如果你的时间戳精确到纳秒，你可以重新合并这些文件并且通常不会打乱事项的顺序（“sort -m”）。
The sort command can also merge already sorted files and check whether a file is sorted or not.
sort命令还可以合并已经排序的文件，并检查某个文件是否已经排序。
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.
如果该查询包含了连接，那么优化器就必须确定连接计划(hash、sort merge或nestedloop)，以及评估或连接表的次序。
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.
如果是unionexpression类，evaluate方法将对两个操作数求值，检查在这两种情况下节点集的结果，然后使用排序合并策略组成联合。
Listing 1. Merge-sort using the fork-join library.
清单1.使用fork - join库进行合并排序。
This paper considers SQL Group-By and aggregation based on merge-sort in parallel database systems.
本文考虑在并行数据库系统中基于归并排序的分组操作和集函数计算。
So again, if you're unwinding what's going on here, this — we sorted the left half which meant sort the left half, then the right half then the merge.
同样，如果你展开正在进行的一切-，我们已对左半部分排好了序，接着右半部分，接着合并。
So again, if you're unwinding what's going on here, this — we sorted the left half which meant sort the left half, then the right half then the merge.
同样，如果你展开正在进行的一切-，我们已对左半部分排好了序，接着右半部分，接着合并。
应用推荐