Teaching recursion using fractals in Prolog
Authors:
Open Access
- 1 February 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCSE Bulletin
- Vol. 20 (1) , 263-266
Abstract
Recursion has traditionally been a difficult concept for students to understand, both as a control structure and as an analytical tool. This paper explores recursion using Prolog (whose predominate control structure is recursion) and through fractals which possess a visually recursive form. We discuss several simple Turbo Prolog programs which demonstrate recursion graphically and whose resultant figures are fractals whose recursive nature is particularly easy to analyze in the Turbo Prolog environment.Keywords
This publication has 8 references indexed in Scilit:
- Teaching programming algorithms aided by computer graphicsACM SIGCSE Bulletin, 1987
- The Beauty of Fractals1986
- Prolog in 10 figuresCommunications of the ACM, 1985
- Describing Prolog by its interpretation and compilationCommunications of the ACM, 1985
- Using simulation to teach recursion and binary tree traversalsACM SIGCSE Bulletin, 1985
- Table-driven algorithms for generating space-filling curvesComputer-Aided Design, 1985
- Short algorithms for space‐filling curvesSoftware: Practice and Experience, 1981
- Understanding and procedural knowledge in mathematics instruction1Educational Psychologist, 1978