PHP Recursive Function

What is Recursive Function in PHP?

In PHP, a recursive function is one that calls itself within its definition. This allows it to solve problems that can be broken down into smaller instances of the same problem.

Basic Structure of Recursive Function in PHP

A recursive function in PHP follows a basic structure:

function recursiveFunction($parameter) {
    if (condition) {
        // base case
    } else {
        recursiveFunction($newParameter);
        // recursive case
    }
}

The function continuously calls itself until a condition (the 'base case') is met. Each call reduces the original problem, leading to an eventual end.

Examples of Recursive Functions in PHP

Example 1: The Factorial of a Number

One classic example of recursion is calculating the factorial of a number. The factorial of a number n is the product of all positive integers less than or equal to n.

function factorial($n) {
    if ($n == 0) {
        return 1; // base case
    } else {
        return $n * factorial($n - 1); // recursive case
    }
}
echo factorial(5);  

Output: 

120

Example 2: Fibonacci Sequence

The Fibonacci sequence is another typical example where each number is the sum of the two preceding ones. Here is how you can generate it using a recursive function:

function fibonacci($n) {
    if ($n == 0) {
        return 0; // base case
    } else if ($n == 1) {
        return 1; // base case
    } else {
        return (fibonacci($n-1) + fibonacci($n-2)); // recursive case
    }
}
echo fibonacci(7);  

Output: 

13

Frequently Asked Questions

What are the 3 parts of a recursive function?

The 3 parts of recursive function are -

1. Base Case (i.e., when to stop)
2. Work toward Base Case
3. Recursive Call (i.e., call ourselves)

What is the limit of recursion in PHP?

The limit of recursion in PHP is determined by the xdebug.max_nesting_level configuration setting, which defaults to 256. This means that recursive function calls cannot exceed this nesting level before PHP triggers a fatal error.

Are recursive functions memory efficient?

Recursive functions can consume more memory as each function call is stored in a stack. Iterative solutions are generally more memory efficient.

Conclusion

Recursive functions are powerful tools for breaking down complex problems into manageable parts. They might seem daunting at first, but once understood, they can make your code cleaner and more efficient. Remember that careful use is crucial to avoid pitfalls like memory exhaustion or infinite recursion. Keep practicing, and you'll become more comfortable with using recursion in PHP.

if you would like to learn more, check out our articles on

• PHP Introduction
• Array push in PHP
• Introduction to OOP in PHP
• PHP date and time
• PHP Arrays

Refer to our guided paths on Coding Ninjas Studio to learn more about DSA, Competitive Programming, JavaScript, System Design, etc. Enrol in our courses and refer to the mock test and problems available. Take a look at the interview experiences and interview bundle for placement preparations.

Happy Learning Ninja! 🥷