Analysis of three ways to implement PHP recursive functions

Above we have introduced to you the use ofphp recursive functions. I believe that friends have a certain understanding of the use of php recursive functions. So today we will introduce to you the implementation of php recursive functions. Three methods!

This article mainly introduces the three basic methods of implementing recursion in PHP, including using references as parameters, using global variables, and using static variables to implement recursion. It also attaches relevant examples and finally gives you a demonstration. , involving PHP's recursive operation skills, friends in need can refer to

Recursive functions are a type of function we commonly use. The most basic feature is that the function itself calls itself, but there must be ## before calling itself. #Conditional judgment, otherwise the call will continue 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 references are used as parameters 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 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 above example is very simple. Use a<10 as the judgment condition. If the condition is true, assign a to result[]; pass the reference of result into the function, and the a generated by each recursion will be Add to result array result. Therefore, the $result array generated in this example is

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 echoa. The actual execution of echo a is when the condition a<10 is not met, echo a returns result. For the upper layer, after executing the recursive function, it starts executing echo $a of this layer, and so on.

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.

Using static variables

We often see static in classes, and 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:

What is the execution result of this piece of code? Is it 00000? Definitely not. It's 01234. First, when calling test() for the first time, static initializes $count. After each execution, the value of $count will be retained and no longer initialized, which 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.

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 need to transfer values between functions, for example:

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 of implementing recursion and infinite classification in PHP. The specific implementation method is as follows:

Summary:

Three methods implement PHP recursive functions, which involve many PHP recursive operation skills. I hope it will be helpful to your work!

related suggestion:

Examples of using php recursive functions

Do you know the precautions for using return in php recursive functions

What is PHP recursive function and simple example explanation

How to use PHP recursive function effectively? Typical examples of php recursive functions

The above is the detailed content of Analysis of three ways to implement PHP recursive functions. For more information, please follow other related articles on the PHP Chinese website!