搜索资源列表
fac
- 用约分实现40以内的Cmn排列组合,并利用排列组合公式实现斐波那契数列的输出。-With about 40 minutes to achieve within Cmn permutations, permutations and combinations and the use of the formula to achieve an output that Fibonacci number Fibonacci sequence.
A-novel-maximum-power-point-tracking-for-photovol
- In this paper, a novel strategy of maximum power point tracking is presented for photovoltaic power generation systems based on Fibonacci search algorithm to realize simple control system to track the real maximum power point even under non-uniform
fibonacci
- Some fabonacci methods.Written in C.
Fib
- C++ codes to calculate the Fibonacci sentences with and without array.
9-2
- 9-2 建立一个一维数组a,并完成以下任务,并输入输出格式参见下图。 (1)以自动生成的斐波那契数列前10项(前两项为1、1)为数组元素赋初值,并输出; (2)将键盘输入的一个数据插入,并数组元素值仍保持有序; (3)把数组中相同的数据删除到只剩下一个,并输出; (4)求出数组所有元素的平均值,并输出; (5)删除数组中所有低于平均值的那些元素。(9-2 create a one-dimensional array a, and complete the following tasks