You are here

Fibonacci Numbers, Recursion, Complexity, and Induction Proofs

by Elmer K. Hayashi (Wake Forest University)

This article originally appeared in:
College Mathematics Journal
November, 1992

Subject classification(s): Discrete Mathematics | Algorithms
Applicable Course(s): 4.7 Discrete Structures

Complexity analysis of three algorithms for Fibonacci numbers

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Average: 2.6 (18 votes)