分治算法（Divide and conquer algorithm）.docVIP

分治算法（Divide and conquer algorithm） This article is contributed by hou guoying The PPT document may not have a good browsing experience at the WAP end. It is recommended that you choose TXT, or download the source file to the native view. Chapter iii divide-anddivide-and-conquer technology Zou quan (PhD) computer science department The feed 33.2 33.3 divide-and-conquer principle Divide - and - Conquer principle integer multiplication matrix multiplication Finding the closest pair of points 3.1 divide-and-conquer principle of divide-and-conquer principle Divide-and-conquer algorithm design of divide-and-conquer algorithm? Divide-and-conquer algorithm analysis of divide-and-conquer algorithm The divide-and-conquer algorithm is designed for the divide-and-conquer algorithm Design process is divided into three stages - Divide: the whole division multiple sub problems Divide: - Conquer: solve the subproblems (recursive calls are design of algorithm) Conquer: solve the subproblems (recursive calls are design of algorithm) - Combine: merge the solutions to the subproblems, form a solution of original problem Combine: merge the solutions to the subproblems, The problem of original problem decomposition sub-problem Solution subproblem Divide ... subproblems Solution subproblem subproblems Solution subproblem Conquer The problem solutions Subproblem solving... Subproblem solving the solution of the original problem The Merge Homework Cloud computing, map-reduce, Hadoop, Mahout Divide-and-conquer algorithm analysis of divide-and-conquer algorithm The analysis process The recursive equation is established The method of establishing recursive equations - set the input size is n, T (n) as the time complexity Set the input size is n, T (n) as the time complexity - when n c, T (n) = theta (1) n c, The time complexity of the Divide phase in the Divide phase Divide the problem into a subproblem. Divide the problem into a subproblem. ? The size of each subproblem is n/b. The size of