搜索资源列表
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,
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 equ
order
- 数据结构,利用循环链表实现斐波那契数列的输出。-data structure
fibonacci
- 斐波那契数列，实现斐波那契数列的推导和输出，支持整数参数。-fibonacci queue
Fibonacci
- 斐波那契数列的演示程序，通过修改源码中m的值可以控制数列的长度-illustrate Fibonacci
Premium-Series
- 费波那西数列（Fibonacci Sequence），又译费波拿契数、斐波那契数列、费氏数列、黄金分割数列。本代码实现了费数列变量的定义。-Premium Series
fib
- CnC 斐波那契数列的例子 在112345这种openmp下不能并行的例子中，看看cnc是如何做到并行的-CnC fib example. In Fibonacci number, openmp cannot do that, see how it works in CnC
01
- 利用递归方式的算法计算斐波那契数列各个项数-Recursively the algorithm to calculate the Fibonacci series of various number of items
daima
- 压缩包里的事5段程序的代码，分别是斐波那契数列 最大子段和 最长公共子序列 矩阵连乘积 整数因子分解问题-Compression bag thing the program code, respectively, even the product of Fibonacci Fibonacci series the largest subsegment, and the longest common subsequence matri
sort
- 两个排序：冒泡排序和选择排序（具体是用c语言来实现的） 一个斐波那契数列的输出-Two sorts: bubble sort and selection sort (specifically, to achieve the c language) A Fibonacci Fibonacci series output
ISE_lab10_fib
- excd-1 斐波那契数列的实现 数码管的显示-excd-1 fib
Fibonacci
- 斐波那契数列算法，很经典，用VC编写，适合初学者-Fibonacci Fibonacci series algorithm, very classic, suitable for beginners, prepared by VC
yuandai
- mp3解析，斐波那契数列，计算单词数，计算器，内存-mp3 resolution, the Fibonacci series, calculate the number of words, calculators, memory
Fibonacci-Sequence
- 利用递归算法计算斐波那契数列的n项的值，-Recursive algorithm to calculate the Fibonacci series, the value of n items
Fibonacci
- 斐波那契数列的代码，仅供参考，用来注册账号用的，不要介意-Fibonacci series code, for reference only, used to register accounts with, do not mind
12
- 斐波那契数列通项公式，最简单的一种写法，谨献给VB初学者。-Fibonacci Sequence formula, the easiest way to write, I would like to dedicate VB beginners.
13
- 斐波那契数列的前N项和，最简单的一种写法，谨献给VB初学者。-The first N Fibonacci series, the easiest way to write, I would like to dedicate VB beginners.
Fib
- 斐波那契数列的测试驱动开发实例，包含测试代码和源代码-The Fibonacci series of test-driven development.
123
- 矩阵求斐波那契数列，时间复杂度logn，快于动态规划和递归-Matrix Fibonacci series, time complexity logn, and faster than the dynamic programming and recursive