You are here

Fibonacci Numbers, Recursion, Complexity, and Induction Proofs

Complexity analysis of three algorithms for Fibonacci numbers

Old Node ID: 
775
Author(s): 
Elmer K. Hayashi (Wake Forest University)
Publication Date: 
Thursday, September 15, 2005
Original Publication Source: 
College Mathematics Journal
Original Publication Date: 
November, 1992
Subject(s): 
Discrete Mathematics
Algorithms
Flag for Digital Object Identifier: 
Publish Page: 
Furnished by JSTOR: 
Rating Count: 
18.00
Rating Sum: 
47.00
Rating Average: 
2.61
Author (old format): 
Elmer K. Hayashi
Applicable Course(s): 
4.7 Discrete Structures
Modify Date: 
Wednesday, February 1, 2006
Average: 2.6 (18 votes)

Dummy View - NOT TO BE DELETED