求解递推方程对程序设计的意义  

The Significance of Solving Recursive Equation for Programming

作　　者：金渊智[1] 郭艳丽[2] Jin Yuanzhi;Guo Yanli(Sanmenxia Polytechnic, Sanmenxia Henan 472000,China;Jiaozuo Teachers College, Jiaozuo Henan 454000,China)

机构地区：[1]三门峡职业技术学院信息传媒学院,河南三门峡472000 [2]焦作师范高等专科学校计算机与信息工程学院,河南焦作454000

出　　处：《柳州职业技术学院学报》2019年第4期95-98,共4页Journal of Liuzhou Vocational & Technical College

基　　金：国家自然科学基金资助项目(71502021)

摘　　要：由于程序设计中常见的递归算法在运行时比较耗时,提出了利用迭代法、尝试法、递归树或主方法先求解递推方程,再根据解的结果来设计程序,这样可以有效的缩短程序的运行时间。使用MATLAB对经典问题Fibonacci数列进行仿真,验证了求解递推方程的必要性,这对于计算机程序设计和算法分析有着重要的现实意义。Since the common recursive algorithm in programming is time-consuming in its running, the scheme to solve these problems is proposed. Using the Iterative method, Trial method, Recursive tree or Master method solve the recursive equation before the programming, then design the program according to the result of the solution, which will effectively shorten the running time of the program. The MATLAB simulation results for classical problem-Fibonacci indicate that it is necessary to solve the recurrence equation before the programming. There are of great practical significance for computer programming and algorithm analysis.

关 键 词：递归 递推方程 程序设计 算法分析 FIBONACCI数列 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]