What is the Master Theorem used for?
The Master Theorem is used to determine the time complexity of divide-and-conquer algorithms by providing asymptotic bounds for their recurrence relations.
What is the general form of a recurrence relation addressed by the Master Theorem?
T(n)= aT (n/b) + f(n)