搜索资源列表
fib序列
- 数据结构算法：使用循环队列，K阶斐波那契数列的一种算法实现。-algorithm data structure : the use of recycled cohort, K bands Fibonacci series, a method.
feibonaqi
- 经典的斐波那其算法程序，经调试成功。采用第归方式实现。-classic Fibonacci algorithm then its procedures, debug success. Adopt naturalization means.
Myfb
- K阶菲波那契算法，运用环形队列实现，空间是K+1-K bands Fibonacci algorithm using circular Queuing, and the space is a K
Fibonacci10
- 适合计算第n个Fibonacci数，采用类定义，n可以是1100内的任意正整数-calculated for the first n Fibonacci numbers using the definitions of the categories, n 1100 can be the arbitrary integer
FibonacciHeap
- 斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上，进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作-Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the
ImproveShortestPathArithmetic
- 应用斐波纳契堆和邻接表改进单源最短路径算法，使其算法的时间复杂性由O( )减少为O（nlogn+e）,其中e为有向图的边的条数。-application Fibonacci heap and the adjacent table to improve single source shortest path algorithm, its algorithm's time complexity of O () reduced to O (nlogn e), where e is for th
fibonaqi
- Fibonacci数列是一种特殊的数列，数列的第一项、第二项的值为1，从数列的第三项开始，每一项的值都等于数列前两项值的和。本题就是编程求解Fibonacci数列第n项的值，并在屏幕上显示出来。-Fibonacci series is a special series, the first series of items, the second of the value of a, series from the third, each have a value equal to the ser
c_Fibonacci
- 数据结构的生成Fibonacci数列和下三角的例子-data structure formation and the Fibonacci series of examples under 1.30
ShortestPathviaFibonacciHeap
- This code implements the shortest path algorithm via the simple scheme and fibonacci heap data structure. It has 3 kinds of testing data input method : random input by computer, reading from the file, reading from the key board.
digui
- 实现了几个递归的函数，比如进制转换，Fibonacci数列，1~n的全排列
fibonacci
- fibonacii函数的实现 算到第20项
Fibonacci1
- Fibonacci数列的c语言实现-Fibonacci Sequence C Language
常见算法及函数源代码
- 算法设计与分析 1. 用直接递归方法计算n！： （2）通过键盘输入n的值，（ 2. 用直接递归方法计算第n个Fibonacci数： 3. 用直接递归方法计算Ackerman函数： 4. 用直接递归方法给出n个元素的全排列： 8. 用直接递归方法求解Hanoi塔问题 ,Algorithm Design and Analysis 1. Using direct recursive meth
Fibonacci
- 用递归算法实现，输入n后可得第n项斐波拉契数，并求出计算所用时间-Recursive algorithm, the input can be obtained after the first n n Feibolaqi item number, and extracts used in the calculation of time
number_of_fibs
- 计算满足a<=x<=b且是Fibonacci数的x个数。-Calculated to satisfy a
feibonaqieshulie
- 用递归算法设计实现的斐波那锲数列，有些地方可能不太完善-Design and Implementation of recursive algorithm using the Fibonacci series Qie, some places may not be perfect
3070Fibonacci
- Pku 3070 Fabbonacci矩阵乘法解法c++代码-Pku 3070 Fabbonacci matrix multiplication method c++ Code
Kfibonacci
- K阶斐波那契数列的前K-1项均为0,第k项为1,以后的每一项都是前K项的和-K-order Fibonacci sequence of the former K-1 item are 0, the first k items for 1, after each of the items are pre-K and
Fibonacci
- 用三种不同的方法求Fibonacci数，分别是递归法，自底向上法，矩阵法，完整的java程序可以运行。-fibonacci java
Serie_Fibonacci
- calcula la serie de fibonacci