In that case, try to divide and conquer. Break the problem into smaller parts you can more easily tackle.
这时候，试着去分解问题再逐一解决，把难题分解成更小的部分，令你解决起来更容易。
Divide-and-conquer is a recursive technique, meaning that it uses some method to split a problem in half, then uses the same method to split those halves in half, and so on.
分治是一种递归算法，就是指利用一种方式把问题一分为二，然后用同样的方法把已分开的问题再一分为二，直到满足最小的解决单元。
Divide-and-conquer algorithms are often useful in sequential environments but can become even more effective in parallel environments because the subproblems can often be solved concurrently.
divide - and - conquer算法也可用于顺序环境中，但是在并行环境中更加有效，因为可以并行处理子问题。
It is the ultimate form of "Divide and Conquer" for at its very core are the assumptions that (1) We must fight each other in order to survive.
这是“分而治之”的终极形式，因其核心有2个假设，(1)我们必须相互斗争才能生存。
A typical parallel divide-and-conquer algorithm takes the form shown in Listing 1.
典型的并行divide - and - conquer算法的形式如清单1所示。
Merge sort takes this idea of divide and conquer, and it does the following: it says let's divide the list in half.
归并排序以如下的步骤使用了分治思想：，把列表分成两半：，下面就是分治。
The divide and conquer method is used very widely in many realms, especially on solving non-numerical calculating problems.
分治法在许多领域，尤其是非数值计算机领域中应用十分广泛。
But in the case that the algorithms fail to find the optimum solution, the divide and conquer algorithm is more accurate.
但在找不到最优解的情况下，最大互关联算法更精确。
By combining the internal buffering technique and the float hole technique with the divide-and-conquer technique, a fast linear-time in-place 2-way merge algorithm is introduced in the paper.
将内部缓冲技术、浮洞技术与分治技术相结合，提出了一种快速线性原地二路归并算法。
By combining the internal buffering technique and the float hole technique with the divide-and-conquer technique, a fast linear-time in-place 2-way merge algorithm is introduced in the paper.
将内部缓冲技术、浮洞技术与分治技术相结合，提出了一种快速线性原地二路归并算法。
应用推荐