Anonymous user
Talk:Fibonacci sequence: Difference between revisions
no edit summary
(→Rules abuse!: OF COURSE!) |
No edit summary |
||
Line 44:
:::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)
== Alternative ==
Fibonacci sequence can also be calculated using this formula.
<math>Fib[n] = \frac{(1+\sqrt{5})^n - (1-\sqrt{5})^n}{2^n \sqrt{5}}</math>
Size of the floating-point type (float, double, long double etc..) will limit how high n can be calulated.
--[[User:Spekkio|Spekkio]] 11:27, 25 November 2011 (UTC)
| |||