关于数据结构中递归的教学探讨

Teaching discussion on the recursion in data structure

一个直接或间接调用自己的函数被称为递归函数,在程序设计中递归是一个非常重要且强有力的工具。在数据结构这门课程的教学过程中,学生对递归的理解和掌握将为以后学习二叉树、图和排序中的算法奠定坚实的基础。通过实例和图表对递归概念和递归执行过程这两方面进行了分析和探讨。在教学过程中采用该方法后,学生对递归的理解更加深刻,取得了更好的教学效果。

A function that calls itself directly or indirectly is named a recursive function.The recursion is a very important and powerful tool in programming.In the teaching process of data structure,the understanding and grasp of the recursion will lay a solid foundation for studying the algorithms about the binary tree,graph and sort in the future for students.This paper analyses and discusses the concept and the implementation process of the recursion through the instances and the graphs.After this method is used in the teaching process,students understand more deeply recursion and we achieve better teaching effects.