首页 | 本学科首页   官方微博 | 高级检索  
     检索      

数据结构中递归算法实验教学的探讨
引用本文:邓鹰.数据结构中递归算法实验教学的探讨[J].怀化学院学报,2004,23(2):132-134.
作者姓名:邓鹰
作者单位:娄底师范高等专科学校现代教育技术中心,湖南,娄底,417000
摘    要:讨论递归算法实验教学的两个问题 问题Ⅰ :先依据有关数学原理写出数递推等式 ,再根据常系数递推等式编写递归算法 ,从而使学生容易掌握递归算法的设计 问题Ⅱ :引入递归状态树 ,使得递归错综复杂的调用关系变得清晰、明了 ,从而使学生更容易分析递归算法的执行过程

关 键 词:常系数递推等式  递归状态树  hanoi塔问题  递归算法
文章编号:1671-9743(2004)02-0132-03
修稿时间:2004年3月27日

On Experiment Teaching of Recursive Algorithm in Data Structure
DENG Ying.On Experiment Teaching of Recursive Algorithm in Data Structure[J].Journal of Huaihua University,2004,23(2):132-134.
Authors:DENG Ying
Abstract:In this paper , we discuss the following two problems in experiment teaching of recursive algorithm.Problem I: The recursive equation is based on some mathematical principles, then according to constant coefficient recursive equation, the recursive algorithm is written out. By this way, it can help the students easily master the design of recursive algorithm.Problem II: With the introduction of recursive status tree, it will make the anfractuous transfer relationship to be clear and simple, so that the students can more easily analyse the executable process of recursive algorithm.
Keywords:constant coefficient recursive equation  recursive status tree  Hanoi tower problem  recursive algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号