Learning recursion as a concept and as a programming technique
Author:
Open Access
- 1 February 1988
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGCSE Bulletin
- Vol. 20 (1) , 275-278
Abstract
Two experiments on learning recursion and iteration were carried out. The first studied learning of the mathematical concept of recursion by having subjects compute mathematical functions by analogy to worked out examples. The results suggest that subjects are quite able to induce a computational procedure for both iterative and recursive functions from examples. Furthermore, prior practice with iterative examples does not seem to facilitate subsequent performance on similar recursive problems, nor does prior practice with recursive examples facilitate performance on iterative problems. The second experiment studied novice subjects' comprehension of iterative and recursive Pascal programs. Comprehension of the iterative program was not improved by prior exposure to the recursive version of the program. Comprehension of the recursive version was improved moderately by prior work with the iterative version.Keywords
This publication has 4 references indexed in Scilit:
- ViewpointCommunications of the ACM, 1987
- Learning Flow of Control: Recursive and Iterative ProceduresHuman–Computer Interaction, 1986
- The role of learning from examples in the acquisition of recursive programming skills.Canadian Journal of Psychology / Revue canadienne de psychologie, 1985
- Learning to Program in LISP1Cognitive Science, 1984