Talk:Fibonacci sequence: Difference between revisions
→Rules abuse!: OF COURSE!
(→Rules abuse!: Cheeky.) |
(→Rules abuse!: OF COURSE!) |
||
Line 42:
::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)
:::Recursive? No! Iterative? No! It is best described as table lookup. (But I admire your cheek :-) --[[User:Paddy3118|Paddy3118]] 02:30, 8 August 2009 (UTC)
::::Table lookup! I ''knew'' there was a better place to put this than "iterative". Gonna change it. :-) -- [[User:Eriksiers|Eriksiers]] 19:59, 9 August 2009 (UTC)
| |||