# Fibonacci serie - Knuth multiplication - Java

*Leonardo Fibonacci*,the Italian mathematician (from Pisa, 1170, one of the most important mathematician of all time) invented the famous serie defined recursively as follows:

We all know that as programmers once in life (at least) we will write some piece of code to compute the element of the serie. Recursive implementation is straightforward but inefficient, due to the exponential number of recursive calls, that make "hard" to compute numbers bigger that 40. It is very easy to come up with some iterative or memoised implementation, that lowers the complexity to and allows to efficently compute "any" number of the serie.

In this post we will derive an implementation (JAVA) that have complexity ^{1)}using results from Knuth, Fibonacci multiplication,1988. Read On…

References

1. | ↑ | using results from Knuth, Fibonacci multiplication,1988 |