divide and conquer
Computing term for an algorithm design paradigm that recursively breaks a problem into sub-problems, solves them, and combines the results.
Divide and conquer is often used in the design of sorting algorithms.
Compound of 分割 (division) + 統治 (rule, governance) + 法 (method). Calque of English 'divide and conquer'.