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