What is recursion in Java and how does it work?

What is recursion in Java and how does it work?

Recursion in Java is a method where a function calls itself to solve a problem. It typically involves a base case and a recursive case.

Can you give me an example of a recursive function in Java?

Sure! Here's a simple example: a function to calculate the factorial of a number:

public int factorial(int n) {
    if (n == 0) return 1; // base case
    return n * factorial(n - 1); // recursive case
}

What are the advantages and disadvantages of using recursion?

Advantages include simpler code and easier problem-solving for complex problems. Disadvantages are higher memory usage and potential stack overflow.

How can I optimize a recursive function?

You can optimize a recursive function using techniques like memoization, which stores previously computed results to avoid redundant calculations.