Recursion visualizer

Factorial Recursion

Multiply a number by each smaller positive integer using recursive calls.

Best O(1)Average O(n)Worst O(n)Space O(n)
Example Call
factorial(5)

Recursion Tree

Ready
Ready to evaluate factorial(5).factorial(5)
fact(5)waitingfact(4)waitingfact(3)waitingfact(2)waitingfact(1)waiting
Call stackEmpty
ActiveWaiting returnResolved

Metrics

Calls0
Returns0
Max depth0
Time taken0.0s

Pseudocode

  1. factorial(n)
  2. if n <= 1
  3. return 1
  4. smaller = factorial(n - 1)
  5. return n * smaller