This technique is a bit like divide and conquer type algorithms that aggressively try to decompose big, difficult tasks into smaller, more manageable pieces.
这项技术有点像分步解决型的算法，它们积极地将大而困难的任务分解成更小、更易于管理的部分。
| 单词 | Divide and conquer algorithm |
| 释义 |
Divide and conquer algorithm
原声例句
两分钟论文 This technique is a bit like divide and conquer type algorithms that aggressively try to decompose big, difficult tasks into smaller, more manageable pieces. 这项技术有点像分步解决型的算法，它们积极地将大而困难的任务分解成更小、更易于管理的部分。
英语百科
Divide and conquer algorithmsIn computer science, divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem. |
| 随便看 |
|
英汉双解词典包含3607232条英汉词条，基本涵盖了全部常用单词的翻译及用法，是英语学习的有利工具。