搜索资源列表
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
javaapizwb_5164
- 4阶斐波那契序列如下：f0=f1=f2=0, f3=1,…,fi=fi-1+fi-2+fi-3+fi-4， 利用容量为k=4的循环队列，构造序列的前n+1项（f0, f1 , f2 ,… fn ），要求满足fn ≤200而fn+1 >200。 -finish english problem
Fibonacci
- 4阶斐波那契序列如下：f0=f1=f2=0, f3=1,…,fi=fi-1+fi-2+fi-3+fi-4， 利用容量为k=4的循环队列，构造序列的前n+1项（f0, f1 , f2 ,… fn ），要求满足fn ≤200而fn+1 >200。 -4-order Fibonacci sequence is as follows: f0 = f1 = f2 = 0, f3 = 1, ..., fi = fi-1+ fi 2+
01
- 利用递归方式的算法计算斐波那契数列各个项数-Recursively the algorithm to calculate the Fibonacci series of various number of items
single-character-Fibonacci-function
- 用单片机的汇编语言实现单字符斐波那契函数，且循环次数为8次。-Microcontroller assembly language to achieve a single character Fibonacci function, and the number of cycles for 8.
the-two-character-Fibonacci-function
- 用单片机的汇编语言实现双字符斐波那契函数，且循环次数为14次-Microcontroller assembly language to achieve the two-character Fibonacci function, and the number of cycles to 14
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-Numbers
- 四种方式求斐波那契数，矩阵法、递归、迭代、公式-compute Fibonacci in four ways
Fibonacci
- 斐波那契数列算法，很经典，用VC编写，适合初学者-Fibonacci Fibonacci series algorithm, very classic, suitable for beginners, prepared by VC
project2
- 数据结构的第二次project，关于递归的项目。里面包含对list，tree及斐波那契结构的应用和练习。-This project will give you experience writing recursive functions that operate on recursively‐defined data structures and mathematical abstractions.
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
fiblogic
- 在linux gCC中实现斐波那契算法的递归与非递归程序，在linux gcc 下编译通过。-Implemented in the linux gCC recursive Fibonacci algorithm with non-recursive procedures, the linux gcc compile.
FibonacciHeap
- 斐波那契堆 学<<数据结构与算法分析in C>>这本书的时候写的-Fibonacci heap
Fibonacci-sequence
- 可以输入任意一个数字n，能在电脑上显示出第n个斐波那契序列。-You can enter any number n, the n-th Fibonacci sequence is displayed on the computer.
12
- 斐波那契数列通项公式，最简单的一种写法，谨献给VB初学者。-Fibonacci Sequence formula, the easiest way to write, I would like to dedicate VB beginners.