Recurrences unrolled into recursion trees level by level — sum each level, compare log_b(a) with d, and read off the master-theorem case for merge sort, binary search, Strassen, and Karatsuba.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Master Theorem Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Recurrences unrolled into recursion trees level by level — sum each level, compare log_b(a) with d, and read off the master-theorem case for merge sort, binary search, Strassen, and Karatsuba. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Best / Average / Worst Case Visualizer: The same algorithm run on three input shapes — see Ω(1), Θ(n), and O(n) emerge from identical code, with the comparisons counted live.
Open toolMerge Sort Visualizer: Merge sort animated: runs split, then merge back as the smaller head wins each comparison — with lo/mid/hi pointers, counters, and pseudocode.
Open toolStrassen Multiplication Visualizer: Watch seven block products replace the naive eight — the M1…M7 formulas, the recombination, and the recurrence that lands at Θ(n^2.807).
Open tool| nodes | size | work/node | level total | |
|---|---|---|---|---|
| level 0 | 1 | n/1 | 16 | 16 |
1Level 0: 1 subproblem(s) of size n/1, each doing n-work → level cost 16.0 (for n=16). Recurrence: T(n) = 2·T(n/2) + n (Merge sort).
T(n) = a·T(n/b) + n^dlevel L: a^L nodes of size n/b^Llevel cost = a^L · (n/b^L)^dsum levels …compare log_b(a) with d → case 1/2/3
Unroll a divide-and-conquer recurrence into its recursion tree, sum each level, and read off which master-theorem case dominates. Change n to cycle merge sort, binary search, Strassen, Karatsuba.
