Instructions: the Master theorem allows you to analyze
the runtime of a recursive method of the form
$$T(n) = a \cdot T(n / b) + O(n^k).$$
On this page you can choose the values of
\(a\),
\(b\), and
\(k\).
The page will then create a made-up algorithm which follows those
parameters, and does the analysis (according to the master theorem) at
the bottom. Use this page to make different examples and check your
understanding.
\mbox{Analysis goes here}