搜索资源列表
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
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 display requirements and give you t
7
- 用递归算法进行计算斐波那契数列，这是一种c++程序-Calculation of the Fibonacci series
3
- 用delphi写的输出斐波那契数列前15项-Delphi write the output with the Fibonacci sequence before the 15
FIBONACCI
- 将斐波那契数列表示出来，并将产生的数列进行分析操作，源代码-Fibonacci series, the source code
fpnq
- 斐波那契数列，输入一个数字n，输出斐波那契数列中大于等于n的第一个数字，并指明该数字是第几个数字。 例如输入数字10；应该指出斐波那契数列中大于等于n的第一个数字为13，该数字在数列中为第7个数字-Fibonacci series, enter a number n, the output in the Fibonacci series is equal to n is greater than the first number, and indicate the number is the
dxs
- 输入一个数据n，计算斐波那契数列(Fibonacci)的第n个值 1 1 2 3 5 8 13 21 34 规律：一个数等于前两个数之和 //计算斐波那契数列(Fibonacci)的第n个值 -Enter a data n, calculate the Fibonacci series (Fibonacci) of the n-th value of 112,358,132,134 law: a number equal to the previous two numbers
order
- 数据结构,利用循环链表实现斐波那契数列的输出。-data structure