Category:Divide and Conquer: Difference between revisions
From charlesreid1
(Created page with "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 mus...") |
No edit summary |
||
| Line 3: | Line 3: | ||
See [[Divide and Conquer]] | See [[Divide and Conquer]] | ||
The [[Master Theorem]] is a theorem used to translate a recurrence relation like | The [[Divide and Conquer/Master Theorem|Master Theorem]] is a theorem used to translate a recurrence relation like | ||
<math> | <math> | ||
Latest revision as of 09:11, 16 July 2017
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.
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.
Pages in category "Divide and Conquer"
This category contains only the following page.