Divide-and-Conquer Recurrences
Master theorem for T(n) = aT(n/b) + f(n).
Key idea
Master theorem for T(n) = aT(n/b) + f(n).
In depth
An algorithm that splits a problem into a subproblems of size n/b and combines in f(n) satisfies T(n) = aT(n/b) + f(n). The Master Theorem compares f(n) with n^(log_b a) to give the solution.
Worked example
Merge sort: T(n) = 2T(n/2) + n gives T(n) = O(n log n).
Real-world uses
- Estimating how long sorting and search algorithms take on large inputs
Common mistake
Applying the Master Theorem outside its conditions.
How to learn this
- Read the key idea and say it in your own words.
- Work through the worked example, then try a similar problem.
- Use the interactive lesson’s visual and mini-quiz to check the pattern.
Frequently asked questions
What is Divide-and-Conquer Recurrences?
Master theorem for T(n) = aT(n/b) + f(n). It is a topic at the expert level in Discrete Math & Number Theory.
Where is Divide-and-Conquer Recurrences used in real life?
Real-world examples: Estimating how long sorting and search algorithms take on large inputs.
What should I learn before Divide-and-Conquer Recurrences?
Make sure you are comfortable with Tower of Hanoi, the previous topic in Discrete Math & Number Theory.
What is a common mistake with Divide-and-Conquer Recurrences?
Applying the Master Theorem outside its conditions.
How can I practise Divide-and-Conquer Recurrences?
Open the interactive lesson, play with the visual, then answer the three-question mini-quiz. Getting two right marks the topic complete.
What comes after Divide-and-Conquer Recurrences?
Move on to Graphs: Basics next.
Related expert topics in Discrete Math & Number Theory
- Strong Induction – Assume all earlier cases to prove the next.
- Well-Ordering Principle – Every nonempty set of positive integers has a least element.
- Partial Orders – Reflexive, antisymmetric, transitive relations.
- Cardinality of Sets – Comparing sizes of infinite sets.
- Countable and Uncountable Sets – ℕ and ℚ are countable; ℝ is not.
- Cantor’s Diagonal Argument – Proof that real numbers are uncountable.