搜索资源列表
fibonacci
- 经典的斐波那契数列算法，使用c++语言编写。希望对大家有用-Classic Fibonacci sequence algorithm, using c++ language. Want to be useful to everyone
java
- 判断斐波那契数列在第几项开始，值大于1000 -to decide Fibonacci sequence
Fibonacci
- 斐波那契数列，递归算法，包括全部文件，可以直接使用-Fibonacci series, recursive algorithms, including all files, can be used directly
biginteager
- 超大整数的C++算法 普通的计算机无法算出巨大的整数 比如算斐波那契数列的时候 一搬只能算出49位 要想算的多智能添加一个类 -BIGINTEAGERS inC++
suanfa
- 算法的试验报告 包括斐波那契数列问题（内涵流程图等等）-Test report including algorithm Fibonacci sequence
144
- 递归经典简单例题,用于求解斐波那契数列相似的问题-a classical case of recurtion
execise1
- 本程序为用户输入一个整数，程序会给出对应该位置的斐波那契数列的值。-This procedure for the user to enter an integer, the program will be given to the location of the Fibonacci sequence value.
3-1
- 验证求n阶乘和斐波那契数列的递归算法-Verify seek n factorial and Fibonacci series, a recursive algorithm
Fibonacci
- 可以实现大整数斐波那契数列元素的输出，输入元素序号，输出整数-Can achieve large integer Fibonacci sequence elements in the output, input element number, output integer
fib
- 汇编语言球斐波那契数列和。汇编语言程序设计-Assembly Language ball Fibonacci series and
3.
- 这是一个斐波那契数列，完全数和排序用C++编程的源代码，希望共享-This is a Fibonacci sequence, complete number, and sort of programming with C++ source code, want to share
2
- 求斐波那契数列，但是操作者要给出最终所要求的数-Demand Fibonacci series, but the operator to give the required number of final
Fibonacci
- 递归数列，斐波那契数列，详细代码，实例，应用-Fibonacci
Fibonacci
- 斐波那契数列1，1，2，3，5，8，13，21……的通项公式，其中a(n+2)= a(n+1)+an 注括号内为下标。-Fibonacci sequence 1,1,2,3,5,8,13,21 ... ... The general formula, where a (n+2) = a (n+1)+ an injection subscr ipt brackets.
Fibo
- 用循环实现斐波那契数列，输入位置，输出数字~~不过不要用太大的位置哟，你的本本会崩溃的~_~-Achieved by circulating Fibonacci series, enter the location, the output figures do not use too much ~ ~ but the location of yo, your books will collapse ~ _ ~
FIber
- 斐波那契数列的C实现方法，大家仔细阅读，好好学习-It is about Fibernasher developed by C program.
Fibonacci
- 斐波那契数列的递归和迭代实现，C++语言，-Fibonacci series of recursive and iterative implementation, C++ language,
fib
- 实现斐波那契数列求和及显示，分别输入要测试的次数，并输入要求和的前几项，屏幕上就能显示要求的和，并给你你要求的次数-Fibonacci series to achieve the sum and show, respectively, enter the number you want to test and enter the first few requirements and on the screen and can displ
7
- 用递归算法进行计算斐波那契数列，这是一种c++程序-Calculation of the Fibonacci series
3
- 用delphi写的输出斐波那契数列前15项-Delphi write the output with the Fibonacci sequence before the 15