Recursion

• Recommended reading:
  • Recursion // Computational Thinking and Programming
• Recursion: A function or process that calls itself to solve smaller instances of the same problem.
• Base Case: The stopping condition in a recursive function that prevents infinite recursion.
• Recursive Step: The part of the recursive function that calls itself with modified input.
• Self-Reference: A concept where something refers to itself, often leading to recursion.
• Recursive Algorithm: An algorithm that solves a problem by reducing it to smaller, similar subproblems.
• Paradoxes: Logical contradictions that can arise from self-reference, highlighting recursion’s complexity.