gen-define-recursion-versus-iteration-and-give-one-short-worked-f74b

Define recursion versus iteration and give one short worked example.

# Recursion vs Iteration **Recursion**: A function that calls itself to solve smaller instances of the same problem until reaching a base case. **Iteration**: Using loops (for, while) to repeat a process until a condition is met. ## Example: Calculating Factorial of 5 ### Recursive Approach ```python def factorial_recursive(n): if n <= 1: # Base case return 1 return n * factorial_recursive(n - 1) # Recursive call factorial_recursive(5) # Call stack: # 5 * factorial_recursive(4) # 5 * 4 * factorial_recursive(3) # 5 * 4 * 3 * factorial_recursive(2) # 5 * 4 * 3 * 2 * factorial_recursive(1) # 5 * 4 * 3 * 2 * 1 = 120 ``` ### Iterative Approach ```python def factorial_iterative(n): result = 1 for i in range(1, n + 1): result *= i return result factorial_iterative(5) # Loop iterations: # result = 1 * 1 = 1 # result = 1 * 2 = 2 # result = 2 * 3 = 6 # result = 6 * 4 = 24 # result = 24 * 5 = 120 ``` **Key difference**: Recursion uses the call stack and is often more elegant but uses more memory; iteration uses explicit loops and is typically more memory-efficient.