What is Recursion in Java: Simple Explanation and Example

In Java, recursion is a technique where a method calls itself to solve a problem by breaking it into smaller parts. Each call works on a simpler version until it reaches a base case, which stops the recursion.

How It Works

Recursion works like a set of nested boxes, where each box contains a smaller box inside it. When a recursive method calls itself, it creates a new 'box' or call with a simpler problem. This continues until it reaches the smallest box, called the base case, which stops further calls.

Think of it like asking a friend to help you count down from a number. You tell them to say the number and then ask the next friend to count down from one less, and so on, until someone reaches zero and says "stop." Then, the answers come back up the chain.

Example

This example shows a recursive method that calculates the factorial of a number. Factorial means multiplying the number by all smaller positive numbers down to 1.

java

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

    public static void main(String[] args) {
        int number = 5;
        int result = factorial(number);
        System.out.println("Factorial of " + number + " is " + result);
    }
}

Output

Factorial of 5 is 120

When to Use

Use recursion when a problem can be divided into smaller similar problems, like searching, sorting, or navigating structures like trees and folders. It is helpful for tasks like calculating factorials, Fibonacci numbers, or exploring file systems.

However, recursion should be used carefully because too many calls can cause the program to run out of memory. Always make sure there is a clear base case to stop the recursion.

Key Points

• Recursion means a method calls itself to solve smaller parts of a problem.
• Every recursive method needs a base case to stop calling itself.
• It is useful for problems that can be broken down into similar subproblems.
• Too deep recursion can cause errors, so use it wisely.

Key Takeaways

Recursion in Java is a method calling itself to solve smaller parts of a problem.

Always include a base case to stop the recursion and avoid infinite loops.

Recursion is ideal for problems like factorial, Fibonacci, and tree traversal.

Be cautious of deep recursion as it can cause memory issues.

Use recursion when the problem naturally breaks down into similar smaller problems.