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

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on education Ročník 43; číslo 3; s. 273 - 276
Hlavný autor:	Stojmenovic, I.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.08.2000 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Binomial coefficients Branched Complexity Computer science education Education Fibonacci numbers Proving Recursive functions Textbooks
ISSN:	0018-9359, 1557-9638
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!