Divide-and-Conquer Algorithms
Divide-and-Conquer Algorithms
Master Theorem for Recurrences
📖 Master theorem: Let and be constants and a function such that for all even ,
Then for all ,
- If .
- If .
- If .
If the function is increasing, then the condition can be dropped. If the master inequality holds with , then we may replace with in the conclusion.