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

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