Recursion Visualizers

5

Step through every Recursion problem with animated runtime state, source highlighting, and curated test cases. Built for coding-interview prep and durable algorithmic intuition.

Factorial of N
Compute n! by multiplying n with the recursive factorial of n-1.
Recursion
Power of Two
Determine if a number is a power of 2 by recursively halving it.
Recursion
Recursion Masterclass
Understand double recursion using the classic Fibonacci sequence.
Double Recursion
Sum of All Numbers in Array
Recursively sum the elements of an array by moving an index to the base case.
Recursion
Sum of First N Numbers
Sum numbers down to 0 using a basic recursive call stack.
Recursion