The control abstraction for the divide and conquer (DC) strategy is as follows: Algorithm DC(P)

Combine subproblem solutions to arrive at the answer to the original large problem.

Divide the problem recursively into smaller subproblems.

Searching for an element from the list ( Binary search)Īs previously mentioned, the divide and conquer strategy operates in three stages:.

Multiplying matrices ( Strassen’s algorithm).

Many computer science problems are effectively solved using divide and conquer.

Working principle of divide and conquer Applications of Divide and Conquer Approach Subproblems may not be exactly n/2 in size. The divide and conquer approach is depicted graphically in following figure. Understanding and developing divide and conquer algorithms requires expertise and sound reasoning. Each branch represents a subproblem and calls itself with a smaller argument.

When a subproblem is reduced to its lowest feasible size, it is solved, and the results are recursively integrated to produce a solution to the original larger problem.ĭivide and conquer is a top-down, multi-branched recursive method. Combine: Combine subproblem solutions in order to deduce the answer to the original large problem.īecause subproblems are identical to the main problem but have smaller parameters, they can be readily solved using recursion.Solve: Subproblems are solved independently.Divide: Divide the problem recursively into smaller subproblems.General Strategy for Divide and Conquerĭivide and conquer algorithm operates in three stages: Traditional algorithms are easily outperformed by the divide and conquer approach.

We will evaluate and contrast the performance of several issues addressed using the traditional way and a divide and conquer strategy. Such algorithms are ideal candidates for parallelization. The approach divides the bigger problem into smaller subproblems, and the solution to the original large problem is achieved by combining the solutions to the smaller subproblems. In this section, we’ll look at a fascinating problem-solving strategy known as divide and conquer.

Fun divide and conquer game