| Recursion [message #2109] |
Wed, 16 July 2008 15:57  |
 akrabat
Messages: 26
Registered: July 2008
Location: Worcester, UK |
Shiny and New |
|
|
Recursion is the term used when an operation is repeated on the results of the same operation. That's a little confusing, but what it means to a programmer is that you have a function that calls itself.
Consider the process of adding up numbers in an array such as:
<?php
$array = array(10, 21, 4);
?>
All we need to do is iterate over the array and add each number to a variable as shown here:
<?php
function sumArray($array)
{
$total = 0;
foreach ($array as $element) {
$total += $element;
}
return $total;
}
$array = array(10, 21, 4);
$result = sumArray($array);
echo "result = $result\n";
?>
As you would expect, the output of the script is:
But, what if the array is nested? For example, an array like this:
<?php
$array = array(10, 20, 5,
array(5, 2, 3)
);
?>
As we iterate over this new array, we will come to an element that is itself an array. We need to sum up the elements within this sub-array and, fortunately, we have just written a function that does just that (sumArray() !), so let's call it within the foreach() loop:
<?php
function sumArray($array)
{
$total = 0;
foreach ($array as $element) {
if(is_array($element)) {
$total += sumArray($element);
} else {
$total += $element;
}
}
return $total;
}
?>
This is recursion as we have called the sumArray() function from within the sumArray() function itself. That is, sumArray() is a recursive function.
We can now use our improved function to add up our nested array:
<?php
$array = array(10, 20, 5,
array(5, 2, 3)
);
$result = sumArray($array);
echo "result = $result\n";
?>
which will now output:
As sumArray() is a recursive function, it will happily handle an array that is many nested levels deep. For example, consider an array that is nested 5 levels deep:
<?php
$array = array(10, 20, 5,
array(5, 2, 3,
array(5, 3,
array(2, 10,
array(19, 1)
),3
), 2, 7
), 3
);
$result = sumArray($array);
echo "result = $result\n";
?>
When this code is run, the output is:
Clearly recursion is a powerful and flexible technique for solving problems involving nested data such as reading through XML structures or handling a tree within a database table (usually implemented with a parent_id column). It is also helpful when writing a sorting algorithm, but most PHP programmers don't need to do that! Recursive solutions also tend to be fairly compact and easy to debug as you only need to do it once!
Obviously, as we're programming, there are trade-offs involved! Recursive solutions are inefficient in terms of performance, so consider caching the result. Also, it's possible to get into situation where the recursion never stops. Always make sure that your function will end! Related to that, when you have deeply nested recursion, you can run out of "stack space" (this area reserved for the list of functions that are currently being called. In other words - make sure you test thoroughly :)
Go on.. write a recursive function today!
Edited to include more notes on the trade offs as noted by mvriel. Thanks!
[Updated on: Wed, 16 July 2008 16:46]
|
|
|
|
|
|
|
|
| Re: Recursion [message #2804 is a reply to message #2109 ] |
Fri, 28 August 2009 09:36  |
agentile
Messages: 3
Registered: August 2009 |
Shiny and New |
|
|
A great book on recursion is "The Little Schemer" by Daniel P. Friedman. Very interesting approach for learning about the topic.
-Anthony
|
|
|
Members
Search
Help
Register
Login
Home
) with functional decomposition - and that Pascal had a maximum recursion level of 256 - go above that and you'd crash the stack.
