Re:Recursive fibonacci benchmark using top languages on GitHub
by Al-Khwarizmi on Friday September 28, 2018 @05:19AM
(#18092014)
The "right" way to do Fibonacci is to use matrix multiplication to get the nth Fibonacci number in logarithmic time (google Fibonacci log n matrix).
[ Parent
| on HN ]
Re:Recursive fibonacci benchmark using top languages on GitHub
by braythwayt on Friday September 28, 2018 @06:37AM
(#18092302)
A matrix implementatiom in JavaScript:
http://raganwald.com/2015/12/20/an-es6-program-to-compute-fi...
It is based on a Ruby implementation: