Divide and Conquer
Divide and Conquer is an algorithmic strategy that involves breaking a complex problem into smaller, more manageable sub-problems. There are three steps: “Divide” the problem into smaller instances, “Conquer” these instances (either by solving them directly or recursively applying the strategy), and then “Combine” the solutions of these sub-problems to form the solution for the original problem.
A classic example of this approach is the Merge Sort algorithm: the array is divided into two halves, each half is recursively sorted, and then the two sorted halves are merged together.