Explaining recursion to the unsophisticated

Authors:
S. M. Haynes
Affiliations:
Department of Computer Science, Eastern Michigan University, Ypsilanti, Michigan
Venue:
ACM SIGCSE Bulletin
Year:
1995

Citing 4
Cited 4

Algorithms (2nd ed.)

Algorithms (2nd ed.)
Data structures and program design in C

Data structures and program design in C
Self-reference is an illustrative essential

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
Data Structures and Program Design in Pascal

Data Structures and Program Design in Pascal

Recursion in gradual steps (is recursion really that difficult?)

Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
SRec: an animation system of recursion for algorithm courses

Proceedings of the 13th annual conference on Innovation and technology in computer science education
A gentle introduction to mutual recursion

Proceedings of the 13th annual conference on Innovation and technology in computer science education
Tail recursive programming by applying generalization

Proceedings of the fifteenth annual conference on Innovation and technology in computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the topic of explaining recursion to Beginning programmers. It briefly presents the common approaches, then describes an extension to those methods called the activation tree.