Recursion Visualizer
Pick a recursive algorithm and click run to list every call with its return value and an indented call tree; algorithm parameters are capped to keep the tree manageable.
Algorithm:
Call tree:
Calculation Result
Download CSV
| No. | Depth | Call | Return | Note |
|---|
Introduction to the tool and how to use it
Online recursion visualizer: pick one of factorial, fibonacci, hanoi, binary search, permutations, subsets, recursive GCD or merge sort, and it lists every function call with its return value and note, drawing the call tree indented by depth. The statistics block reports total calls, max recursion depth and duplicate subproblems, which makes the cost of naive recursion easy to see. All parameters are capped, and output is trimmed automatically when the node limit is reached.
Message board
All messages →-
No one has spoken up yet — want to go first?