divide and conquer

RU: раздели и властвуй

An algorithm design paradigm that recursively splits a problem into smaller subproblems of the same type, solves each independently, and combines their results. The recurrence T(n) = aT(n/b) + f(n) governs the complexity; canonical examples are merge sort O(n log n) and binary search O(log n).