递归程序设计教学方法的研究

On Teaching Method of Recursive Programming

递归程序设计基于分治法和全息的思想方法,将大规模系统中的复杂问题转化为小规模系统问题进行求解(如Hanio塔问题)。递归算法是一种自然且合乎逻辑的解决问题的方式,但其执行效率通常比较差。因此,在求解某些问题时,常采用递归算法来分析问题,用非递归算法来求解问题;递归程序设计在算法设计中具有重要的理论意义和实用价值,但其在C语言、数据结构、程序设计教学上是难点,主要是思想方法的不同。介绍了在教学中通过一组例题从简单到复杂的程序实例,引导学生由浅入深地掌握递归程序及搜索的编写技巧,取得较好的效果。

Based on divide-and-conquer method and holographic method, recursive program design method was used to solve complex problems in large scale systems by dividing them into small scale system problems (such as the Hanio tower).Recursive algorithm is a natural and logical way to solve the problem, but its efficiency is usually poor. Therefore, in some cases, recursive algorithm is often used to analyze problems while non recursive algorithm is used to solve the problems. As recursive programming has an important theoretical significance and practical value in the design of algorithms, it becomes the teaching difficulty in the teaching of C language, data structure and program design. In the paper, a series of programming examples were introduced to guide students to master the skills of recursive programming and searching and has obtained good teaching effect.