English
资源说明：分治法(Divide and Conquer)
Our first design strategy: Divide and Conquer(算法设计策略) Often recursive, at least in definition(通常是递归形式的)
Strategy(策略思想):
Break a problem into 1 or more smaller subproblems that are identical in nature to the original problem(将一个 问题分割成几个规模小、性质相同的独立的子问题)
Solve these subproblems (recursively)(通常通过递归方法解 决子问题)
Combine the results for the subproblems (somehow) to produce a solution to original problem(合并每个子问题的解 得到整个问题的解)
Note the assumption(前提假设):
We can solve original problem given subproblems’
solutions(原始问题的解能够通过子问题的求解获得)
本源码包内暂不包含可直接显示的源代码文件，请下载源码包。
