Recurrence & Master Theorem Visualizer

Explore recurrences of the form T(n)=aT(n/b)+f(n), compare recursion-tree levels, and classify the recurrence using the Master Theorem.

a — number of subproblems b — shrink factor f(n)=n^k Example input n

Recursion Tree

Master Theorem: compare f(n)=n^k with n^log_ba. Smaller k means recursive work dominates; equal means level work is balanced; larger means f(n) dominates under the usual regularity condition.