Posted by
Andy Brown on 20 February 2012 | no comments
Recursive Programming
The dictionary definition of Recursion says it all:
Recursion (n.) - see under "Recursion"
And if you didn't get (or like) that joke, here's a real definition:
recursive programming is when you write a program which calls itself.
In practice there are few occasions when you'll actually use recursion - but
when you do need it, it's nearly indispensable!
The examples this blog will show are:
|
Example
|
Notes |
|
Folder contents |
Recursively looping over folders and subfolders |
|
Creating breadcrumbs |
Creating menu breadcrumbs for hierarchical data |
|
Calculating a factorial |
Calculating the factorial of a number |
Of these, it would be much harder to write the first two examples without
using recursion.