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

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!