On the number of arithmetical operations for finding Fibonacci numbers

AbstractTwo algorithms for finding Fibonacci numbers are presented. They are analyzed both from the worst case and average case point of view. The algorithms allow the number of arithmetical operations needed for solving the problem to be decreased