The Master theorem
(A) assumes the subproblems are unequal sizes
(B) can be used if the subproblems are of equal size
(C) cannot be used for divide and conquer algorithms
(D) cannot be used for asymptotic complexity analysis
Answer: (B)
Explanation: The master method is a formula for solving recurrence relations of the form:
T(n) = aT(n/b) + f(n)
where, n = size of input
a = number of sub-problems in the recursion
n/b = size of each subproblem.
Option (B) is correct.
Quiz of this Question
Article Tags :
Recommended Articles