激光样式问题的多种算法及其分析  

Multiple Algorithms and Analysis of Laser Pattern Problem

作　　者：吴云周 WU Yunzhou(School of Computer and Software,Chengdu Neusoft University,Chengdu,China,611844)

机构地区：[1]成都东软学院计算机与软件学院,成都611844

出　　处：《福建电脑》2023年第5期21-25,共5页Journal of Fujian Computer

摘　　要：斐波拉契数列问题是使用递归算法的典型问题。激光样式问题属于斐波拉契数列问题。激光样式问题的各种算法、算法的优化和非递归化转换,对所有斐波拉契数列问题都具有借鉴意义。本文对激光样式问题提出两种思路,每一种思路又提出多种算法。并通过对多种算法的分析、程序设计及其效率分析,总结该类问题的较优算法。Fibonacci sequence problem is a typical problem using recursive algorithm,while laser pattern problem belongs to Fibonacci sequence problem.The various algorithms,algorithm optimization and non-recursive transformation of the laser pattern problem are of reference significance to all Fibonacci series problems.In this paper,we propose two ideas for the problem of laser pattern,and each idea also proposes a variety of algorithms.Through the analysis of various algorithms,program design and efficiency analysis,the better algorithms for this kind of problems are summarized.

关 键 词：递归 斐波拉契数列 自顶向下 自底向上 复杂度 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]