> See also: > - Reference # The Master Theorem https://www.codesdope.com/course/algorithms-masters-theorem/ $T(n)=aT(\frac{n}{b})+f(n)$ - $a$ = the number of subproblems generated in each recursive calls - $b$ = the factor by which the problem size is reduced in each recursive call Three Main Cases