Talk:Fibonacci sequence: Difference between revisions
→Rules abuse!: new section
(→Clarified?: I tried to fix some...keep checking) |
(→Rules abuse!: new section) |
||
Line 35:
--[[User:PauliKL|PauliKL]] 15:14, 14 April 2009 (UTC)
:I just tried to fix what I could figure out based on that definition. Some of the iterative examples may still be partially wrong, but I think I got a lot of the recursive examples. --[[User:Mwn3d|Mwn3d]] 18:17, 14 April 2009 (UTC)
== Rules abuse! ==
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!
| |||