Three basic ways to implement recursion in php, three kinds of recursion in php_PHP tutorial

Three basic ways to implement recursion in php, three kinds of recursion in php

Recursive function is a type of function we commonly use. The most basic feature is that the function calls itself, but There must be a conditional judgment before calling itself, otherwise it will continue to be called indefinitely. What methods can be used to implement recursive functions? This article lists three basic ways. Understanding it requires a certain amount of basic knowledge, including an understanding of global variables, references, static variables, and an understanding of their scope. Recursive functions are also a good technique for solving infinite levels of classification. If you are interested in infinite classification, please refer to PHP to use recursive functions to achieve infinite classification. I'm used to explaining complex truths in layman's terms. If you really don't understand, please refer to the manual.

Using references as parameters

Regardless of whether the reference is a parameter or not, we 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 the same room with $b regardless of its original storage address. Therefore any change to the stored address value will affect both values. ​

Functions have their own way of doing things, even if they have 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.

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 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 it is not, it is 1098765432. Why? Because the function has performed the next function recursion before executing echoa. The actual execution of echo a is when the condition a

Using global variables

Use global variables to complete recursive functions. Please make sure you understand what global variables are. The global variable declared within the function is just a reference to the 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.

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

Utilizing 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.

Give me an example:

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

$count++;
}
test();
test();
test();
test();
test();

What is the execution result of this code? Is it 00000? Definitely not. It's 01234. First, when calling test() for the first time, static initializes $count. After each subsequent execution, the value of $count will be retained and no longer initialized. This is equivalent to directly ignoring the sentence static $count=0;.

Therefore, the effect of applying static to a recursive function can be imagined. Variables that need to be used as "bridges" between recursive functions are initialized using static, and the value of the "bridge variables" will be retained for each recursion.

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

Summary

The so-called recursive function focuses on how to handle the function call itself and how to ensure that the required results can be reasonably "transmitted" between functions. Of course, there are also recursive functions that do not require the transfer of values ​​between functions, such as:

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

    test($a);
  }
}

Faced with such a function, we don’t have to worry about it. By the way, a deep understanding of variable references can go a long way in solving this type of problem.

Finally, I would like to share with you a method to implement recursion and infinite classification in PHP. The specific implementation method is as follows:

<&#63;php
echo "<pre class="brush:php;toolbar:false">";
$area = array(
array('id'=>1,'area'=>'北京','pid'=>0),
array('id'=>2,'area'=>'广西','pid'=>0),
array('id'=>3,'area'=>'广东','pid'=>0),
array('id'=>4,'area'=>'福建','pid'=>0),
array('id'=>11,'area'=>'朝阳区','pid'=>1),
array('id'=>12,'area'=>'海淀区','pid'=>1),
array('id'=>21,'area'=>'南宁市','pid'=>2),
array('id'=>45,'area'=>'福州市','pid'=>4),
array('id'=>113,'area'=>'亚运村','pid'=>11),
array('id'=>115,'area'=>'奥运村','pid'=>11),
array('id'=>234,'area'=>'武鸣县','pid'=>21)
);
function t($arr,$pid=0,$lev=0){
static $list = array();
foreach($arr as $v){
if($v['pid']==$pid){
echo str_repeat(" ",$lev).$v['area']."<br />";
//这里输出，是为了看效果
$list[] = $v;
t($arr,$v['id'],$lev+1);
}
}
return $list;
}
$list = t($area);
echo "<hr >";
print_r($list);
&#63;>

http://www.bkjia.com/PHPjc/1049131.htmlwww.bkjia.comtruehttp: //www.bkjia.com/PHPjc/1049131.htmlTechArticleThere are three basic ways to implement recursion in php. The three recursive functions of php recursion are a type of functions we commonly use. The most basic feature is that the function calls itself, but there must be conditions before calling itself...