Recursion is suitable for problems where you can divide
the problem into one or more
independent subsets;
you can solve the problem for the subsets and use the
results to efficient calculate the result for the entire
set; and each of the subsets should be significantly smaller
than the original set.
A recursive solution for Fibonacci fails the first requirement,
the "sets" are not independent (it also fails the third
requirement). Calculating the factorial is
also a common example for recursion, but that fails the
the third requirement, making that the overhead of calling
subs is significant, and it's not compensated by simpler
code. Recursion can't really beat:
my $p = 1;
$p *= $_ for 2 .. $n;
Abigail
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
| |
For: |
|
Use: |
| & | | & |
| < | | < |
| > | | > |
| [ | | [ |
| ] | | ] |
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.