How to use recursive functions in php to accumulate numbers

What are the methods to implement recursive function? How to add numbers using a recursive function? This article mainly introduces the three implementation methods of php recursive function 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 have conditional judgment before calling itself, otherwise it will cause infinite calls . This article lists three recursive function implementation methods. The first uses to reference as parameters, the second uses global variables, and the third uses static variables. It is necessary to understand such problems. It's a bit basic, including an understanding of global variables, references, and static variables, as well as an understanding of their scope. 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;
}

The above example is very simple. Use a 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;
}

The third method: using static variables

We often use static variables in classes See static
, 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:

##Q ? 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(){
static $count=0;
echo $count;
$count++;
}
test();
test();
test();
test();
test();

Summary

　　所谓递归函数，重点是如何处理函数调用自身是如何保证所需要的结果得以在函数间合理"传递"，当然也有不需要函数之间传值得递归函数，例如：

代码如下:

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

  下面通过一段代码演示一下php使用递归函数实现数字累加的方法。

代码如下所示：

代码如下:

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

      

The above is the detailed content of How to use recursive functions in php to accumulate numbers. For more information, please follow other related articles on the PHP Chinese website!