Recursion in Methods

Home Coding PlayGround Data Structure And Algorithms Number Conversions

Java Functions And Methods

Java Foundation

Java Flow Control

Java Inner Classes

Java 8 Features

Java File I/o

Java Multithreading

Java Arrays And Strings

Java Exception Handling

Java Classes

Java OOP's

Java Collections Framework

A recursive method is a method that calls itself to solve a smaller instance of the same problem. Recursion is often used for problems that can be divided into sub-problems, such as factorial calculation or traversing trees.

Example of Recursion (Factorial Calculation):

Code Example

​x
 
public class RecursiveMethodExample {    // Recursive method to calculate factorial    public int factorial(int n) {        if (n == 0) {            return 1;        } else {            return n * factorial(n - 1);        }    }​    public static void main(String[] args) {        RecursiveMethodExample example = new RecursiveMethodExample();        int result = example.factorial(5);  // Calculate factorial of 5        System.out.println("Factorial of 5: " + result);    }}

Output

Factorial of 5: 120

Recursion in Methods

Java Tutorial

Python Tutorial