far side of recursion

A tétel rövid nézete
dc.contributor.authorWirth, Michael A.
dc.date.accessioned2024-09-04T09:47:09Z
dc.date.available2024-09-04T09:47:09Z
dc.date.issued2015-06-01
dc.description.abstractRecursion is somewhat of an enigma, and examples used to illustrate the idea of recursion often emphasize three algorithms: Towers of Hanoi, Factorial, and Fibonacci, often sacrificing the exploration of recursive behavior for the notion that a "function calls itself". Very little effort is spent on more interesting recursive algorithms. This paper looks at how three lesser known algorithms of recursion can be used in teaching behavioral aspects of recursion: The Josephus Problem, the Hailstone Sequence and Ackermann's Function.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 13 No. 1 (2015) , 57-71
dc.identifier.doihttps://doi.org/10.5485/TMCS.2015.0381
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/379776
dc.identifier.volume13
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14966
dc.rights.accessOpen Access
dc.rights.ownerMichael A. Wirth
dc.subjectrecursionen
dc.subjectproblem solvingen
dc.subjectJosephusen
dc.subjectHailstoneen
dc.subjectAckermannen
dc.titlefar side of 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:
291.19 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)