Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

recurrence

The master theorem

taught

Taught in

The master theorem
Discrete Mathematics II — Combinatorics

Requires

the-recursion-tree-method required
big-o required

Required by

Binary search and merge sort as recurrences required
Master theorem case 1: leaves dominate required
Master theorem case 2: balanced levels required
Master theorem case 3: the root dominates required

Local knowledge map

Local knowledge map

Click to expand

Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.