Scratch递归程序设计的教学探讨  

Teaching Research on Scratch Recursion Programming

作　　者：江玉珍 朱映辉 邓清华 王晓辉 陆锡聪 JIANG Yu-zhen;ZHU Ying-hui;DENG Qing-hua;WANG Xiao-hui;LU Xi-cong(School of Computer Information Engineering,Hanshan Normal University,Chaozhou 521000,China)

机构地区：[1]韩山师范学院计算机与信息工程学院,广东潮州521000

出　　处：《电脑知识与技术》2020年第15期158-159,163,共3页Computer Knowledge and Technology

基　　金：教育部产学合作协同育人项目(201901105010);潮州市科技计划项目(2017GY01);韩山师范学院质量工程与教育教学改革项目(粤韩师教字〔2019〕67号)。

摘　　要：在常规的程序设计教学中,递归算法能在运行过程中实现自我调用,能将大问题层层转化为小规模相似问题来进行求解,虽然其理解上抽象难懂但却能够轻巧地解决很多复杂问题,是结构化程序教学上重点和难点。通过对递归算法原理的分析,提出抓住三个要点及构造递归表达式的学习方法。结合Scratch简洁的编程风格,通过举例提出基于Scratch的递归算法教学引导思路,并分析探讨更有效的递归教学方法。In conventional programming teaching,recursive algorithm can implement self-call during the running process,and can solve the large problems by transforming them into small-scale similar ones.Although abstract and complicated,it can solve many complex problems easily.It is both the difficulty and the key point of the structured program teaching.By analysing the principle of recursion algorithm,the learning method of three-key-points and recursion expression are put forward.Combined with the concise programming style of scratch,the teaching guidance idea of recursion algorithm based on scratch is proposed by some examples,and more effective recursive teaching methods are analyzed and explored.

关 键 词：递归 回溯 递推 SCRATCH 汉诺塔 

分 类 号：G642[文化科学—高等教育学]