Solving problems by breaking them into smaller versions of themselves.
Calculates n! by calling itself with n-1 until it hits the base case of 0! = 1.
Loading...
Returns the nth Fibonacci number by recursively summing the two previous values (O(2^n)).
Loading...
Moves n disks from source to destination peg using recursion. Classic O(2^n) recursive problem.
Loading...