Divide and Conquer
Domain: Algorithms
🎯 Motivation
Split the problem into smaller subproblems, solve each independently, then combine the results. Powering merge sort, quick sort, and many algorithms.
📋 Concrete Example
Merge sort: divide array in half, sort each half (smaller subproblem), merge results. Each half is sorted the same way — a smaller version of the same problem.
🔗 Analogy
A group project: split the work among 4 members. Each does their part independently, then the parts are combined into the final report. Dividing makes each part manageable.