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算法也可用于顺序环境中，但是在并行环境中更加有效，因为可以并行处理子问题。

youdao

Listing 1. Pseudo-code for generic divide-and-conquer parallel algorithms.

清单1 .通用divide - and - conquer并行算法的伪代码。

youdao

But in the case that the algorithms fail to find the optimum solution, the divide and conquer algorithm is more accurate.

但在找不到最优解的情况下，最大互关联算法更精确。

youdao

OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.

好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。

麻省理工公开课 - 计算机科学及编程导论课程节选