The Divide and Conquer algorithm consists of a dispute using the three steps listed below.

Divide the original problem into sub-problems.

Conquer: Solve each sub-problem one at a time, recursively.

Combine: Put the solutions to the sub-problems together to get the solution to the whole problem.