Recursive algorithms in computer science courses: Fibonacci numbers and binomial coefficients

We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science courses in the first three years of the curriculum. Fibonacci numbers and binomial coefficients were frequently used as examples of branched recur...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on education Vol. 43; no. 3; pp. 273 - 276
Main Author: Stojmenovic, I.
Format: Journal Article
Language:English
Published: New York IEEE 01.08.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Binomial coefficients
Branched
Complexity
Computer science education
Education
Fibonacci numbers
Proving
Recursive functions
Textbooks
ISSN:0018-9359, 1557-9638
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We observe that the computational inefficiency of branched recursive functions was not appropriately covered in almost all textbooks for computer science courses in the first three years of the curriculum. Fibonacci numbers and binomial coefficients were frequently used as examples of branched recursive functions. However, their exponential time complexity was rarely claimed and never completely proved in the textbooks. Alternative linear time iterative solutions were rarely mentioned. We give very simple proofs that these recursive functions have exponential time complexity. The proofs are appropriate for coverage in the first computer science course.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9359
1557-9638
DOI:10.1109/13.865200