Implementation methods of three PHP recursive functions and the accumulation of numbers-PHP Tutorial-php.cn

Implementation methods of three PHP recursive functions and the accumulation of numbers

不言

Release： 2023-03-31 13:30:01

Original

1743 people have browsed it

What are the methods to implement recursive functions? How to add numbers using a recursive function? This article mainly introduces three implementation methods of PHP recursive functions and how to implement digital accumulation. Friends in need can refer to it.

Recursive functions are a commonly used type of function in programming. Its characteristic is that the function itself can call itself, but it must be conditionally judged before calling itself, otherwise it will cause infinite calls. This article lists three recursive function implementation methods. The first uses references as parameters, the second uses global variables, and the third uses static variables. Understanding such problems requires some basic knowledge, including global variables, references, and static variables. understanding, and also need to have an understanding of their scope of action. No more nonsense here, please see below for detailed introduction.

The first method: use references as parameters

Regardless of whether references are parameters or not, you must first understand what a reference is? A reference simply means that two variables with different names point to the same storage address. Originally, each variable had its own storage address, and assignment and deletion went their own way.

Okay now, the two variables share a storage address. $a=&$b; . What it actually means is that $a has to share a room with $b regardless of its original storage address. Therefore any change to the stored address value will affect both values.

Functions originally do their own thing, even if they are functions with the same name. Recursive functions consider taking references as parameters and becoming a bridge to form data sharing between two functions. Although the two functions seem to operate on different addresses, they actually operate on the same memory address.

The code is as follows:

function test($a=0,&$result=array()){
$a++;
if ($a<10) {
    $result[]=$a;
    test($a,$result);
}
echo $a;
return $result;
}

Copy after login

The above example is very simple. Use a<10 as the judgment condition. If the condition is true, assign a to result[]; The reference of result is passed into the function, and the a generated by each recursion will be added to the result array result. Therefore, the $result array generated in this example is Array ( [0] => 1 [1] => 2 [2] => 3 [3] => 4 [4 ] => 5 [5] => 6 [6] => 7 [7] => 8 [8] => 9 ).

What is more interesting in this example is the value of echo a . I believe many people think it is 12345678910, but actually it is not, it is 1098765432. why? Because the function has performed the next function recursion before executing echo a.

. For the upper layer, after executing the recursive function, the echo $a, of this layer starts to be executed, and so on. Second method: Use global variablesUse global variables to complete recursive functions. Please make sure you understand what global variables are. globalDeclaring variables within a function is nothing but a reference to an external variable with the same name. The scope of the variable is still within the scope of this function. Changing the values of these variables will naturally change the values of external variables with the same name. But once

is used, the variable with the same name is no longer a reference with the same name. It is not necessary to understand such a deep level to use global variables to implement recursive functions. You can understand recursive functions naturally by maintaining the original view of global variables. The code is as follows:

function test($a=0,$result=array()){
    global $result;
    $a++;
    if ($a<10) {
        $result[]=$a;
        test($a,$result);
    }
    return $result;
}

Copy after login

The third method: using static variables We often see

static

in classes ,Today we use it in recursive functions. Remember the role of static: initialize the variable only the first time the function is called, and retain the variable value.

code is as follows:

function test(){
static $count=0;
echo $count;
$count++;
}
test();
test();
test();
test();
test();

Copy after login

What are the execution results of this code? Is it

00000

? Definitely not. It’s 01234. First, call

test(), static

for the first time to initialize

$count

. After each subsequent execution, the value of $count will be retained and will not be continued. Initialization is equivalent to directly ignoring the sentence static $count=0;. Therefore, the effect of applying static to a recursive function can be imagined. Use static to initialize variables that need to be used as "bridges" between recursive functions. Each recursion will retain the value of the "bridge variable". The code is as follows:

function test($a=0){
    static $result=array();
    $a++;
    if ($a<10) {
        $result[]=$a;
        test($a);
    }
    return $result;
}

Copy after login

Summary

The so-called recursive function focuses on how to handle the function call itself and how to ensure the required results. It can be "passed" reasonably between functions. Of course, there are also recursive functions that do not need to pass values between functions, for example:

function test($a=0){
    $a++;
    if ($a<10) {
        echo $a;
        test($a);
    }
}

Copy after login

The following is a piece of code to demonstrate how PHP uses recursive functions to accumulate numbers.
The code is as follows:

<?php
function summation ($count) {
   if ($count != 0) :
     return $count + summation($count-1);
   endif;
}
$sum = summation(10);
print "Summation = $sum";
?>

Copy after login

面对php递归函数，不必要伤脑筋，深入的理解变量引用相关知识对解决此类问题很有帮助，以上内容就是php递归函数三种实现方法及如何实现数字累加的全部内容，希望对大家今后的学习有所帮助。

以上就是本文的全部内容，希望对大家的学习有所帮助，更多相关内容请关注PHP中文网！