~/ learn/ comp-372/ cards/ Solving recurrences II: the master theorem
1 of 6

Type the master-recurrence form and its watershed function

Type the master-recurrence form and its watershed function

Answer

T(n) = a*T(n/b) + f(n) watershed = n^(log_b a) compare f(n) to the watershed

Case 1 if f is polynomially smaller than the watershed (Θ of watershed); case 2 if they tie (add a log); case 3 if f is polynomially larger and regularity holds (Θ of f).

space flip · ← → navigate · esc to exit
NORMAL ~/memra/library/6d5f35e3-d1af-4fe7-892b-7485e9db3edc/flashcard utf-8 LF