Recursion Visualizer
Explore recursive algorithms with interactive visualizations and step-by-step execution
Choose Algorithm
Tower of Hanoi
O(2^n) | O(n)
Classic puzzle demonstrating recursive problem solving
Move n disks from source to targetUse auxiliary tower
Fibonacci Sequence
O(2^n) | O(n)
Generate Fibonacci numbers using recursion
F(n) = F(n-1) + F(n-2)Base cases: F(0) = 0, F(1) = 1
Factorial
O(n) | O(n)
Calculate factorial using recursive approach
n! = n × (n-1)!Base case: 0! = 1
Binary Search
O(log n) | O(log n)
Search in sorted array using divide and conquer
Divide array in halfCompare with middle element
Merge Sort
O(n log n) | O(n)
Sort array using divide and conquer strategy
Divide array into two halvesRecursively sort each half
Quick Sort
O(n log n) | O(log n)
Sort array using pivot-based partitioning
Choose pivot elementPartition around pivot
Algorithm:
Tower of HanoiAnimation Speed1000ms
Step: 0/0 | ReadyO(2^n) | O(n)
Tower of Hanoi Visualization
A
3
2
1
B
C
Algorithm Properties
Time Complexity:O(2^n)
Space Complexity:O(n)
Type:Recursive
Key Concepts
Move n disks from source to target
Use auxiliary tower
Never place larger disk on smaller