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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on education Jg. 43; H. 3; S. 273 - 276
1. Verfasser:	Stojmenovic, I.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.08.2000 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Binomial coefficients Branched Complexity Computer science education Education Fibonacci numbers Proving Recursive functions Textbooks
ISSN:	0018-9359, 1557-9638
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!