The divide-and-conquer method is a method of [[algorithm design]] that uses the divide, conquer and combine process. Often the conquer step involves [[base/Algorithms/recursion|recursion]]. The divide-conquer-combine process is 1. divide the problem into one or more identical subproblems 2. solve the subproblems recursively 3. combine subproblem solutions to solve the original problem