Java Recursion Compiler

Examples included

• Run the factorial example
• Run the fibonacci example
• Run the sum digits rec example
• Run the power example
• Run the gcd example

Practical tips

• Always have a base case — otherwise StackOverflowError.
• Naive Fibonacci is O(2^n). For n > 35, use memoization or iteration.
• Tail-recursive code in Java is NOT optimized — convert to loops if depth matters.

Common questions

Why does my recursion crash with StackOverflowError?

Either no base case, or the base case is never reached. Trace the first few calls on paper.

When should I use recursion in Java?

Tree/graph traversal, divide-and-conquer, backtracking. Avoid when a simple loop is clearer.