Fibonacci beyond binary recursion

A tétel rövid nézete
dc.contributor.authorWirth, Michael A.
dc.date.accessioned2024-09-04T09:45:52Z
dc.date.available2024-09-04T09:45:52Z
dc.date.issued2008-06-01
dc.description.abstractThe Fibonacci series is a classical algorithm taught in computer science, usually implemented in some programming language. It is hard to find a programming textbook which doesn't touch on Fibonacci, and it's most common use is in the illustration of binary recursion. There are also many ways of tailoring the basic algorithm in order to implement it. This paper discusses some novel algorithms, which help address some of the limitations of binary recursion, but also illustrate how differing algorithms can be pedagogically beneficial. We introduce a simple algorithm for accurately calculating any Fibonacci number.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 6 No. 1 (2008) , 173-185
dc.identifier.doihttps://doi.org/10.5485/TMCS.2008.0203
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue1
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379629
dc.identifier.volume6
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14819
dc.rights.accessOpen Access
dc.rights.ownerMichael A. Wirth
dc.subjectFibonaccien
dc.subjectalgorithmsen
dc.subjectbinary recursionen
dc.subjectaccurate algorithmsen
dc.titleFibonacci beyond binary recursionen
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
168.21 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)