摘要
文章介绍了斐波那契数列及其意义、价值和应用场景,分析了其7种编程实现方式:递归方式、数组方式、vector<int>方式、queue<int>方式、迭代方式、公式方式、二分矩阵方式,对其编程实现进行了具体对比分析,最后指出迭代方式是最佳方式。
This paper introduces the meaning, value and application scenarios of the Fibonacci sequence. Seven kinds of programming implementation are analyzed and compared, including the methods of recursive, array, vector, queue, iteration, formula and binary matrix, and points out that the iterative method is the best way.
作者
何俊毅
He Junyi(Xuzhou No.1 Middle School, Xuzhou, Jiangsu 221002, China)
出处
《计算机时代》
2017年第2期52-54,共3页
Computer Era
关键词
斐波那契数列
编程
递归
数组
迭代
Fibonacci sequence
programming
recursive
array
iteration
