Talk:Fibonacci sequence: Difference between revisions
Content added Content deleted
m (→Fibonacci n-Step Numbers: added whitespace between sentences.) |
|||
| Line 182: | Line 182: | ||
I wrote this little exploration of various recursive takes on Fib generation a while ago: http://pastebin.com/ExTuYkAE Among other things it takes time consumption and multiple uses into account. Might look a bit foreign to many as it uses the new ES6 fat arrow syntax for pretty much everything. |
I wrote this little exploration of various recursive takes on Fib generation a while ago: http://pastebin.com/ExTuYkAE Among other things it takes time consumption and multiple uses into account. Might look a bit foreign to many as it uses the new ES6 fat arrow syntax for pretty much everything. |
||
If someone wants to incorporate it into the JavaScript section, be my guest! |
If someone wants to incorporate it into the JavaScript section, be my guest! |
||
=== Ocaml matrix example remark === |
|||
I notice someone edited the Ocaml matrix example to say 'actually O(n*n)'. I can't identify who that was now, but unless someone can explain/justify it I will remove it, as it seems to be incorrect. [[User:TobyK|TobyK]] ([[User talk:TobyK|talk]]) |
|||