Divide and Conquer Technique

This is a top-down technique for designing algorithms in which a problem is divided into smaller sub-problems, the sub-problems are solved in a straightforward manner and the solution of the original problem is derived by combining the solutions of the sub-problems.

Hence, this technique consists of the following phases:

• Diving the problem into smaller sub-problems
• Solving the sub-problems individually
• Combining the solutions of the sub-problems into the solution to the given problem.

In this context, we will discuss the following algorithms.

1. Binary Search

2. Max-Min Problem

3. Merge Sort

4. Quick Sort

5. Selection Sort

6. Strassen's Matrix Multiplication

---

Happy Exploring!