Define the divide and conquer paradigm.

Divide and Conquer is an algorithmic paradigm that solves a problem by breaking it down into smaller, more manageable subproblems, solving each subproblem independently, and then combining their solutions to form the solution to the original problem.

Key Steps:

1. Divide: Break the problem into smaller subproblems.
2. Conquer: Solve each subproblem recursively.
3. Combine: Merge the solutions of the subproblems to obtain the final solution.