Intermediate
Discrete Mathematics & Math
Q45 / 100
What is the Master Theorem?
Correct! Well done.
Incorrect.
The correct answer is B) A formula for solving recurrences T(n) = aT(n/b) + f(n) arising from divide-and-conquer algorithms
B
Correct Answer
A formula for solving recurrences T(n) = aT(n/b) + f(n) arising from divide-and-conquer algorithms
Explanation
Master Theorem: compare f(n) with n^(log_b a). If f(n) = O(n^(log_b a - ε)): T(n) = Θ(n^(log_b a)). If equal: Θ(n^(log_b a) log n). If f(n) dominates: Θ(f(n)). Merge sort: T(n)=2T(n/2)+n → O(n log n).
Progress
45/100