Tumble, a fast simple iteration algorithm for Fibonacci

Authors:
L. F. Johnson
Affiliations:
University of Waterloo, Systems Design Engineering, Waterloo, Ontario N2L 3G1, Canada
Venue:
Information Processing Letters
Year:
2004

Citing 2
Cited 0

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A fast algorithm for computing Fibonacci numbers

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

A faster linear iteration process for Fibonacci (and Lucas) numbers is given. Algorithms are derived for individual numbers and for sequence generation. A general algorithm for generalized Fibonacci numbers is derived from these.