Talk:Fibonacci sequence: Difference between revisions
Content added Content deleted
m (→Rules abuse!: Grammar) |
(→Rules abuse!: more, I say! more!) |
||
| Line 40: | Line 40: | ||
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) |
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) violates the rules. It's a neat idea if your language uses a finite integer type. --[[User:Mwn3d|Mwn3d]] 20:50, 7 August 2009 (UTC) |
:I don't think this (or other types of memoized solutions) violates the rules. It's a neat idea if your language uses a finite integer type. --[[User:Mwn3d|Mwn3d]] 20:50, 7 August 2009 (UTC) |
||
::I was thinking more along the lines of the IOCCC award, "Worst Abuse of the Rules" -- the one given to the guy who turned in the empty source file and called it the world's smallest [[quine]]. |
|||
::Anyway... what I posted can be applied to pretty much any data type, given time, space, and interest... although I wouldn't want to use it for, say, the limits of an 80-bit float. -- [[User:Eriksiers|Eriksiers]] 20:56, 7 August 2009 (UTC) |
|||