Recursive and Iterative Functions for Generating Fibonacci Numbers
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
As reference to the popular computing press will confirm, there is a great deal of misunderstanding about the efficient calculation of Fibonacci numbers. As the "obvious" iterative version is linear and the "obvious" recursive version is exponential, many assume that recursion is inherently less efficient than iteration. Even in the technical press, the more efficient logarithmic versions are given in an abstract way, which makes their use rather inconvenient. This report gives complete functions, both iterative and recursive, for the linear and logarithmic algorithms.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1989-06
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1017
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report