Fibonacci sequence: Difference between revisions
→{{header|Mathematica}} / {{header|Wolfram Language}}: simplification of more efficient recursive and iterative....
GordonBGood (talk | contribs) (→{{header|Python}}: new section on faster recursion not requiring memoization, and its limits...) |
GordonBGood (talk | contribs) (→{{header|Mathematica}} / {{header|Wolfram Language}}: simplification of more efficient recursive and iterative....) |
||
Line 3,145:
<lang mathematica>fibi[prvprv_Integer, prv_Integer, rm_Integer] :=
fib[
However, the recursive approaches in Mathematica are limited by the limit set for recursion depth (default 1024 or 4096 for the above cases), limiting the range for 'n' to about 1000 or 2000. The following using an iterative approach has an extremely high limit (greater than a million):
<lang mathematica>fib[
▲ For[i = 2, i < n, i++, tmp = prv; prv += prvprv; prvprv = tmp];
▲ Return[prvprv + prv]]</lang>
If one wanted a list of Fibonacci numbers, the following is quite efficient:
| |||