Divide-and-Conquer
Divide and Conquer is an algorithm design paradigm based on multi-branch recursion.
It involves recursively breaking down a problem into simpler subproblems until they are simple enough to be solved directly. Then, the solutions to these subproblems are combined to form the solution to the original problem.
Divide: Split the problem into several subproblems of the same type.
Conquer: Solve the smallest unit of subproblems and conquer them.
Combine: Combine the results of the subproblems to form the solution to the original problem.
Divide and Conquer is a representative algorithm that utilizes recursion and is an important technique for solving Optimal Substructure.
Last updated