In computer science, divide and conquer (D&C) is an important 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.
from: http://en.wikipedia.org/wiki/Divide_and_conquer_algorithm
本文介绍了计算机科学中重要的算法设计范式——分而治之算法。该算法通过递归方式将复杂问题分解为两个或更多子问题,直至子问题足够简单可以直接求解。最后,将子问题的解组合成原始问题的解。

430

被折叠的 条评论
为什么被折叠?



