Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci

Details Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci

2010-10-31

arxiv.org/abs/1011.0148v1

Computer Science

Discrete Mathematics

11 pages, 1 table This paper illustrates the importance of considering storage size when running experiments and that the resu

Scientific paper

Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be applied to Lucas. A formula is given to estimate the largest n, where F_n does not overflow the implementation's data type. The danger of timing runs on input that is too large for the computer representation leads to false research results.

Affiliated with

Also associated with

No associations

Rating

Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663535