Divide and conquer

Definition

The "divide and conquer" strategy is a problem-solving approach in which a complex problem is divided into smaller, more manageable subproblems. Each subproblem is solved independently, and then the solutions are combined to solve the original problem.

Related terms

Recursion:

A programming technique where a function calls itself to solve a smaller version of the same problem.

Merge Sort:

A sorting algorithm that uses the "divide and conquer" strategy by repeatedly dividing an array into two halves until it consists of single elements, then merging them back together in sorted order.

Quick Sort: Another sorting algorithm that also utilizes the "divide and conquer" strategy by selecting a pivot element and partitioning an array around it.