《数据结构》课程中抽象概念与程序语句间的桥梁

在课程教学中,我们经常遇到算法及其程序实现的讲解,一些抽象概念在程序中体现为具体的程序语句,为了将这些程序语句和抽象概念联系起来,通常需要给程序加大量的注解。一种将程序语句与抽象概念联系起来的做法是在程序代码中使用宏,宏的名称以抽象概念命名,这样可以简化对程序的理解,将注意力集中在算法的逻辑层次上。论文以数据结构课程中的二叉树中序遍历算法和堆排序算法为实例,探讨在在程序中使用宏,以帮助建立抽象概念与程序语句的桥梁,达到让学生更容易理解程序的目的。

In teaching a course,we have to frequently explain algorithms and programs to students.Some abstract concepts are present in the program as concrete programming sentences.When explaining these sentences,we have to add extra comments to establish relationships between these sentences and corresponding abstract concepts.Another more effective way for establishing such relationships is using Macro definition。Two examples,namely middle tracing algorithm of binary tree and heap sort algorithm,are shown for using Macro definition to establish bridge between program sentences and abstract concepts,so that the students can understand more easily the algorithm in program.