Anonymous user
Talk:Fibonacci sequence: Difference between revisions
→Rules abuse!
(→Rules abuse!: oops - forgot to sign) |
|||
Line 39:
Take a look at the third example under BASIC, Iterative. I stretched the meaning of ''generate'' and just predetermined all the numbers that can be handled by my chosen data type (LONG; 32-bit signed, without support for F<sub>n</sub> where n < 0) and dumped them into an array. Bam! Almost instant results! :-) -- [[User:Eriksiers|Eriksiers]] 20:48, 7 August 2009 (UTC)
:I don't think this (or other types of memoized solutions) violate the rules. It's a neat idea if your language uses a finite integer type. --[[User:Mwn3d|Mwn3d]] 20:50, 7 August 2009 (UTC)
| |||