For example, implement merge sort.
例如，如何实现合并排序。
20 minutes: Coding question. For example, implement merge sort.
接下来的20分钟：编程的问题。例如，如何实现合并排序。
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具有完全的访问权限。
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.
中间进行选择排序，右边进行归并排序，看看会发生什么。
This paper considers SQL Group-By and aggregation based on merge-sort in parallel database systems.
本文考虑在并行数据库系统中基于归并排序的分组操作和集函数计算。
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的惯例可能是：让熟练掌握特定桌面字处理程序的某个人建立某种类似“邮件合并”的操作，使文档输出参数化。
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.
合并排序本身并非并行算法，因为它可以顺序执行。当数据集太大，内存无法容纳，必须分片保存的时候，经常使用合并排序。
Listing 1. Merge-sort using the fork-join library.
清单1.使用fork - join库进行合并排序。
Listing 1. Merge-sort using the fork-join library.
清单1.使用fork - join库进行合并排序。
应用推荐