Category:Divide and Conquer

Algorithm technique, closely related to Recursion, in which a larger problem is sub-divided into smaller problems. In the process of shrinking the problem, the problem must become easier - enough to balance the work of splitting and merging.

See Divide and Conquer

The Master Theorem is a theorem used to translate a recurrence relation like

$ T(n) = a T \left( \frac{n}{b} \right) + f(n) $

into a complexity class.