使用指针实现的自然归并排序。
二路归并排序算法的思想比较容易理解。
It is easy to understand the concept of 2-way merge sort algorithms.
让我们在这个列表上运行归并排序，然后我们在看一下代码。
Let's run merge sort on it, and then we'll look at the code.
中间进行选择排序，右边进行归并排序，看看会发生什么。
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.
归并排序以如下的步骤使用了分治思想：，把列表分成两半：，下面就是分治。
Merge sort takes this idea of divide and conquer, and it does the following: it says let's divide the list in half.
给出了归并排序算法的一种改进算法，对具有“离散”性的多个数据排序时利用该算法具有较明显的优势。
This article has provided a kind of improved algorithm for merging sort, which has remarkable advantage in sorting a large amount of discrete data.
本文讨论超立方体结构上的并行归并排序算法，着重分析算法的通信复杂性，在此基础上推导算法的加速比。
This paper discusses the parallel merging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.
在这些上面再运行归并排序，根据归纳，如果这样是正确的，我将重新得到两个列表，然后我会把它们合并在一起。
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.
说明：运用归并排序，在用二分法查找，算法复杂度：nlogn，n个数两两相加，若能等于特定数m，则输出yes，否则输出no。
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。
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.
应用推荐