The Difficulty of Using Procedures with the Recursive Call

DOI 16 References

Bibliographic Information

Other Title
  • 再帰呼び出しを含む手続きの処理の難しさ

Search this article

Description

This study examined why it is difficult to use recursive processing. Kurland & Pea (1989) took up the recursive call of LOGO procedure and suggested that “embedded recursion” (the recursive call was embedded in between) was more difficult than “tail recursion” (the recursive call came last). In Experiment 1, 10 procedures like LOGO were prepared and tested whether participants (N=36) used procedures correctly or not. There were two types of procedures: 5 tail recursion tasks and 5 embedded recursion tasks. Because participants were not familiar with procedures and recursion, they learned procedure of the recursive call in advance. The result showed that the average of embedded recursion tasks was lower than that of tail recursion tasks. It was confirmed that embedded recursion was more difficult than tail recursion. In Experiment 2, we examined whether the difficulty of embedded recursion is due to embeddedness itself or to embedded recursive structure. There were two types of procedures: 5 embedded recursive tasks and 5 only-embedded tasks. The result showed that the average (N=20) of embedded recursive tasks was lower than that of only-embedded tasks. It turned out that the difficulty of embedded recursion is due to embedded recursive structure.

Journal

References(16)*help

See more

Keywords

Details 詳細情報について

  • CRID
    1390282679461447040
  • NII Article ID
    10009705329
  • NII Book ID
    AN1047304X
  • DOI
    10.11225/jcss.6.389
  • ISSN
    18815995
    13417924
  • Text Lang
    ja
  • Data Source
    • JaLC
    • CiNii Articles
  • Abstract License Flag
    Disallowed

Report a problem

Back to top