Divide and Conquer is an algorithm paradigm, not an algorithm itself. It is set up in such a way that it can handle a large amount of data, split it down into smaller chunks, and determine the solution to the problem for each of the smaller chunks. It combines all of the piecewise solutions of the smaller chunks to form a single global solution. This is known as the divide and conquer technique. The Divide and Conquer algorithmic paradigm employ the steps given below:
Divide : The algorithm separates the original problem into a set of subproblems in this step.
Conquer : The algorithm solves each subproblem individually in this step.
Combine : In this step, the algorithm combines the solutions to the subproblems to obtain the overall solution.
Some of the algorithms which use the Divide and Conquer Algorithmic paradigm are as follows:
* Binary Search
* Merge Sort
* Strassen's Matrix Multiplication
* Quick Sort
* Closest pair of points.
