Two 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. © 1989.
Protasi, M., Talamo, M. (1989). On the number of arithmetical operations for finding Fibonacci numbers. THEORETICAL COMPUTER SCIENCE, 64(1), 119-124 [10.1016/0304-3975(89)90102-3].
On the number of arithmetical operations for finding Fibonacci numbers
TALAMO, MAURIZIO
1989-01-01
Abstract
Two 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. © 1989.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
