Recursion & the Call Stack

Divide and conquer

A recursive function calls itself on a smaller input until it hits a base case.

function factorial(n) {
  if (n <= 1) return 1;   // base case
  return n * factorial(n - 1);
}
factorial(5); // 120

Every call adds a frame to the call stack — forget the base case and you'll overflow it.