搜索资源列表
The-Fibonacci-Numbers
- 面向对象程序设计课后习题编程代码斐波那契数字-Object-oriented program design school exercise programming code Fibonacci numbers
Fibonacci-series
- 斐波那契数列 递归调用，主要用于了解递归用法-The Fibonacci series recursive calls, mainly used to understand recursion usage
Fibonacci
- 可以生成FIbonacci数列，初始化从一开始，产生给定个数的Fibonacci数列。求质数，起泡法，选择排序。-Fibonacci array
fibonacci
- 利用数据结构实现200以内四阶斐波那契数列的计算以及显示-Less than 200 fourth-order Fibonacci series calculation and display data structure
Fibonacci-Method
- 斐波那契法（Fibonacci）求解单峰值函数极小值。 函数可以自己进行宏定义，本代码已经定义了一个简单的函数，用来测试其可行性。-The Fibonacci method for solving single peak function minimum. Function can define your own macros, the code defines a simple function to test its feasibility.
Fibonacci-and-linkedlist
- multicore programming using openmp Fibonacci series linked list
Fibonacci
- The fibonacci series in C
Dynamic-Fibonacci
- 动态规划计算斐波那契数（后一个数等于前面两个数的和）1，1，2，3，5，8，13，21，34，55，89，144…… -Dynamic programming computes Fibonacci numbers (after a number equal to the previous two numbers) 1,1,2,3,5,8,13,21,34,55,89,144 ......
Fibonacci
- 通过模板类，获取斐波那契数列任意位的数，还可以修改成任意数列的类-By the template class, gets the Fibonacci sequence any number of bits can also be modified into an arbitrary sequence of classes
Fibonacci
- 最基本的C#菲波哪切算法 ，初学者可参考和学习。-Which C# Fibonacci basic cut algorithm, beginners can refer to and learn.
Fibonacci
- 运筹学->常用一维搜索算法->斐波那契数列法C语言实现-Operations Research-> common one-dimensional search algorithm-> Fibonacci sequence France C language
Fibonacci-sequence
- 递归调用产生斐波那契数列和循环产生斐波那契数列的效率的比对，输入要产生的斐波那契数列的位数-Recursive call produces Fibonacci sequence and cycling Fibonacci series comparing the efficiency of input to generate Fibonacci sequence of digits
Fibonacci
- 输入一个数据n，计算斐波那契数列(Fibonacci)的第n个值, 规律：一个数等于前两个数之和-Enter a data n, calculate the Fibonacci sequence (Fibonacci) the first n values, rule: a number equal to the sum of the previous two numbers
fibonacci-heap
- 斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。-Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.
fibonacci
- 求 fibonacci数列的，c语言编写的 -solve fibonacci
Recursive-Fibonacci-sequence
- 斐波那契数列递归,采用c语言编写,注释齐全-Recursive Fibonacci sequence, using c language, complete notes
Fibonacci
- Fibonacci数列(高精度算法） Input 有多行，每行代表一个正整数n（1 ≤ n ≤ 1001）。 Output 对每个输入，输出Fibonacci数列的第n项。-Fibonacci sequence (precision arithmetic)
fibonacci-recursion
- 斐波那契数列的递归算法实现的源代码，计算机算法设计与分析作业1-Fibonacci series recursive algorithm source code, design and analysis of computer algorithms operating 1
Fibonacci
- 著名的Fibonacci数列，定义如下 f(1)=1,f(2)=1,f(n)=f(n-1)+f(n-2)，n>2 用文字来说，就是斐波那契数列由 0 和 1 开始，之后的斐波那契系数就由之前的两数相加。首几个斐波那契系数是： 0, 1, 1, 2, 3, 5, 8, 13, 21-The famous Fibonacci sequence, defined as f (1) = 1, f (2) = 1, f (n) = f (n-1)+f (n-2), n> 2 wor
Fibonacci
- 利用递归产生斐波那契数列的一个小程序。希望能有帮助-Recursive Fibonacci sequence produces a small program.Hope can be helpful.