What is tail recursion in Java?

What is tail recursion in Java?

Tail recursion is a specific type of recursion where the recursive call is the last operation in the function.

Can you give me an example of tail recursion in Java?

Sure! Here's a simple example:

public class TailRecursionExample {
    public static int factorial(int n, int accumulator) {
        if (n == 0) return accumulator;
        return factorial(n - 1, n * accumulator);
    }

    public static void main(String[] args) {
        System.out.println(factorial(5, 1)); // Output: 120
    }
}

What are the benefits of using tail recursion?

Tail recursion can optimize memory usage and prevent stack overflow errors, making it more efficient for large inputs.