Fast Fibonacci

by Ricardo Fernández Serrata

Version 2 (May 9, 2021)

Download (14 downloads)

Computes Nth Fib. number faster than O(n). It uses rounding because Binet's Formula returns some non-integer results and it's generalized to work with complex numbers (which AM doesn't support natively)

This flow is optimized for speed and float precision, not accuracy nor generalized functions.

Never use this to generate an array of the Fib sequence, because it will be slower than computing simple additions. But if you want an unsorted array of Fib numbers with some missing values, you should use this because it computes faster by avoiding recursion and loops

4.0 average rating from 1 reviews

5 stars
0
4 stars
1
3 stars
0
2 stars
0
1 star
0
Reports
0

Rate and review within the app in the Community section.