搜索资源列表
huibianyuyan
- 汇编语言课程设计的程序,包括1 递归方法实现50以下的Fibonacci数 2 字符串查找 3 歌曲管理 4 图书管理 以及设计报告-assembly language curriculum design process, including a recursive method 50 following two Fibonacci search string four three songs management Book Management and the design report
feibonaqi
- 经典的斐波那其算法程序,经调试成功。采用第归方式实现。-classic Fibonacci algorithm then its procedures, debug success. Adopt naturalization means.
Fibonacci102
- 得到Fibonacci 可视化-be Fibonacci Visualization
斐波那契序列
- 这里实现的是二阶斐波那契序列,如果需要,可以看看里面的方法,程序还是自己编的比较有收获-here is the realization of the second Fibonacci sequence, if necessary, they can look at the methods, procedures, or the provision of more gains
Myfb
- K阶菲波那契算法,运用环形队列实现,空间是K+1-K bands Fibonacci algorithm using circular Queuing, and the space is a K
zouyaoxian
- 黄金分割法,二分法,Fibonacci法求多项式函数最值-Golden Section, dichotomy, the Fibonacci method for the value of a polynomial function
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
fib16
- 汇编语言可以用递归计算16位二进制的fibonacci数-assembly language can be used recursive calculation of 16 binary number fibonacci
stockchartx
- 支持所有流行的股票图表显示格式:Candlestick、 OHLCV、OHLC、和HLC、Darvas Boxes、3D Candlesticks、Renko、Kagi、Three Line Break、Point 、Figure、Candlevolume、Equivolume、Shaded Equivolume。每一个图表风格可以实时更新。 实时自动技术分析更新。 支持创建Line Studies,如Ellipse, Rectangle、 Trend Line、Speed Line
anyofFibonacciNumbers
- Fibonacci Numbers(斐波纳契数列)的较大位数的解决问题。-Fibonacci Numbers (Fibonacci series Naqi) the larger the median solve the problem.
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
Generator
- This a Fibonacci Sequence Generator. I am 15 and this took some thinking. The code is obviously not refined. It does the job. Fibonacci顺序发生器 使用高斯消除法解n阶方程 -This a Fibonacci Sequence Generator. I a m 15 and this took some thinking. The code is
c_Fibonacci
- 数据结构的生成Fibonacci数列和下三角的例子-data structure formation and the Fibonacci series of examples under 1.30
feibona
- 此程序在VC界面上能够实现斐波那契序列,操作简单,便于读者使用-this procedure in VC interface can be achieved Fibonacci sequence, simple operation and ease of use of the reader
shixianshurushuchu
- 用递归的方法编写函数求Fibonacci级数的源程序-using recursive function method for the preparation of the source Fibonacci Series
wage
- 这是计算fibonacci数列的,如果大家有用请翻阅,
fibonacci_t
- 用fibonacci变换方法对图象做置乱或逆置乱,效率极高,在信息隐藏中属常用的方法之一。调用函数为f=fibonacci_t(I,r,s),其中参数分别为I=被置乱的图像,r=置乱密钥,s=0置乱,s=1逆置乱
fib
- 定义:f0=f1=1, fn=fn-1+fn-2(n>=2)。{fi}称为Fibonacci数列。 输入n,求fn mod q。其中1<=q<=30000。 Input format: 第一行一个数T(1<=T<=10000)。 以下T行,每行两个数,n,q(n<=109, 1<=q<=30000)、 Output format: 文件包含T行,每行对应一个答案。