Recursion vs. iteration: An empirical study of comprehension

Journal of Systems and Software

Volumn 32, Issue 1, 1996, Pages 73-82

  Benander, Alan C ^a   Benander, Barbara A ^a,b   Pu, Howard ^a  

^a CLEVELAND STATE UNIVERSITY   (United States)

^b Cleveland State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; EDUCATION; PASCAL (PROGRAMMING LANGUAGE); RECURSIVE FUNCTIONS; STATISTICAL METHODS;

COMPREHENSION; ITERATION; RECURSION;

COMPUTER PROGRAMMING;

EID: 0029759776     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/0164-1212(95)00043-7     Document Type: Article

References (27)

1. Anderson, J. R., Farrell, R., and Sauers, R., Learning to Program in LISP, Cogn. Sci. 8, 87-129 (1984).
2. Benander, A. C., Benander, B. A., and Gorla, N., An Empirical Study of COBOL Programs Via a Style Analyzer: The Benefits of Good Programming Style, J. Syst. Software 10, 271-279 (1989).
3. Birtwistle, G., The Coroutines of Hanoi, SIGPLAN Not. 20(1), 9-10 (1985).
4. Brooks, R., Towards a Theory of Comprehension of Computer Programs, Int. J. Man-Machine Stud. 18, 543-554 (1983).
5. Burton, R. P., and Campbell, D. M., A Curious Recursive Function, Int. J. Comp. Math. 19, 245-257 (1986).
6. Crosby, M., and Stelovsky, J., How Do We Read Algorithms? A Case Study, Computer 23, 24-35 (1990).
7. Ford, G., An Implementation-Independent Approach to Teaching Recursion, Commun. ACM 213-216 (1984).
8. Horowitz, E., and Sahni, S., Data Structures in Pascal, Computer Science Press, New York, 1990, p. 21.
9. Hunt, H. B., and Rosenkrantz, D. J., Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze, Siam J. Comp. 15, 831-850 (1986).
10. Kruse, R. L., On Teaching Recursion, Commun. ACM 92-95 (1982).
11. Mayer, H., and Perkins, D., Towers of Hanoi Revisited: A Nonrecursive Surprise, SIGPLAN Not. 19(2), 80-84 (1984).
12. Maziar, S., Solution of the Towers of Hanoi Problem Using a Binary Tree, SIGPLAN Not. 20(5), 16-20 (1985).
13. McCracken, D., Ruminations on Computer Science Curricula, Commun. ACM 30, 3-4 (1987).
14. McLeod, R., Systems Analysis and Design, The Dryden Press, Orlando, Florida, 1994, p. 753.
15. Meyer, B., A Note on Iterative Hanoi, SIGPLAN Not. 19(12), 38-40 (1984).
16. Miara, R., Musselman, J., Navarro, J., and Shneiderman, B., Program Indentation and Comprehensibility, Commun. ACM 26, 861-867 (1983).
17. Piroli, P., and Anderson, J. R., The Role of Learning From Examples in the Acquisition of Recursive Programming Skills, Can. J. Psychol. 39, 240-272 (1985).
18. Rohl, J. S., Recursion via Pascal, Cambridge University Press, Cambridge, UK, 1984.
19. Rohl, J. S., Towers of Hanoi: The Derivation of Some Iterative Versions, Comp. J. 30, 70-76 (1987).
20. Sinha, A., and Vessey, I., Cognitive Fit: An Empirical Study of Recursion and Iteration, IEEE Trans. Software Eng. 18, 368-379 (1992).
21. Soloway, E., Adelson, B., and Ehrlich, K., Knowledge and Processes in the Comprehension of Computer Programs, in The Nature of Expertise, (M. T. H. Chi, R. Glaser, and M. J. Farr, eds.), Lawrence Erlbaum, 1988.
22. Stadel, M., Another Nonrecursive Algorithm for the Towers of Hanoi, SIGPLAN Not. 19(9), 34-36 (1984).
23. Sykes, F., Tillman, R., and Shneiderman, B., The Effect of Scope Delimiters on Program Comprehension, Software Pract. Exp. 13, 817-824 (1983).
24. Wiedenbeck, S., Learning Iteration and Recursion from Examples, Int. J. Man-Machine Stud. 30, 1-22 (1989).
25. Wiedenbeck, S., The Initial Stage of Program Comprehension, Int. J. Man-Machine Stud. 35, 517-540 (1991).
26. Wiedenbeck, S., and Fix, V., Characteristics of the Mental Representations of Novice and Expert Programmers: An Empirical Study, Int. J. Man-Machine Stud. 39, 793-812 (1993).
27. Winston, P. H., and Horn, B. K. P., LISP, Addison-Wesley, Reading, MA, 1981, p. 63.