Divide and Conquer

Divide a problem into several subproblems, solve each of them, and combine their solutions into a solution to the initial problem

Examples:
- mergesort
- quicksort
- Strassen’s matrix multiplication
(but not binary search)