Solve problems by breaking them down recursively. Backtracking explores all possibilities, undoing choices when paths lead nowhere.

• Solve problems by breaking them down recursively

function factorial(n) {
  if (n <= 1) return 1;
  return n * factorial(n - 1);
}

console.log(factorial(5)); // 120
// ...

• Factorial works

• Base case stops recursion; recursive case calls itself with smaller input
• Backtracking: try option, recurse, undo option if it doesn't lead to solution
• Stack overflow risk: set max recursion depth or use iteration

Solve problems by breaking them down recursively. Backtracking explores all possibilities, undoing choices when paths lead nowhere.

• Solve problems by breaking them down recursively

function factorial(n) {
  if (n <= 1) return 1;
  return n * factorial(n - 1);
}

console.log(factorial(5)); // 120
// ...

• Factorial works

• Base case stops recursion; recursive case calls itself with smaller input
• Backtracking: try option, recurse, undo option if it doesn't lead to solution
• Stack overflow risk: set max recursion depth or use iteration