id: 06526658
dt: j
an: 2016a.00951
au: Wirth, Michael A.
ti: The far side of recursion.
so: Teach. Math. Comput. Sci. 13, No. 1, 57-71 (2015).
py: 2015
pu: ,
la: EN
cc: N70 P20
ut: recursion; problem solving; Josephus; Hailstone; Ackermann
ci:
li:
ab: Summary: Recursion 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.
rv: