搜索资源列表
sy1
- 使用如下所谓的简单变量“数据平移”方法来求出Fibonacci数列的第n项（的具体项值）并显示在屏幕上（正整数n通过键盘输入）：说明变量old1=1，old2=1，newItem；新的Fibonacci项newItem总是“距它最近”的前两项（old1与old2）的累加和。而后通过“old1=old2 old2=newItem ”进行所谓的“数据平移”。接着计算另一个新的Fibonacci项newItem，依次循环，直到求出数列的第n项时为止。-Use the following so-call
Fibonacci_search_algorithm
- 用C++写的Fibonacci 查找算法的实现，可以稍作修改当成标准的C程序用。-With C++ Written Fibonacci search algorithm can be slightly amended C as standard procedure used.
hb
- 计算机汇编实验：表格显示字符，查找匹配字符串，分类统计字符个数，查找电话号码，求Fibonacci-Computer compilation of the experiment: table shows the characters, to find matching strings, keep separate statistics on the number of characters to find telephone numbers, and Fibonacci
Fibonaccisequence
- 个函数的功能是构建一个 n 项的菲波那契数列-A function of its functions is to build a n of the Fibonacci series
k
- 一个对于一个给定的 数（ N ）， 求不大于 N 的最大 Fibonacci 数-One for a given number (N), for not more than N of the largest Fibonacci number
huangjinfengehefabonaccia
- 可以用黄金分割和斐波那契算法实现优化，只要改变相应的参数就可以用了-Can be used and the Golden Section Fibonacci optimization algorithm implementation, as long as the change in the corresponding parameters can be used
program
- 程序设计方法与实践——2007 一些小程序：Automated Judge scr ipt Fibonacci数列问题 Football (aka Soccer) Really Strange!! Red and Black-Program Design Method and Practice- 2007 a number of small procedures: Automated Judge scr ipt Fibonacci series problem Footbal
stackfibnaqi
- 斐波那契数列计算的非递归算法 用栈来模拟递归的经典题目-Fibonacci calculation of non-recursive algorithm used to simulate the recursion stack classic topic
recurs
- /* Divide and Conquer */ /* Find minimum and maximum from a given series of numbers */ /* by using above said policy */ gcd fibonacci-/* Divide and Conquer*/ /* Find minimum and maximum from a given series of numbers*/ /* by using
fibseq
- At Ocaml Define a function fibseq that takes an natural number n and return a Fibonacci sequence as a list of n elements.
ycomb
- Y-combinator 解决fibonacci数列的一个实现，实现了不定义函数名称而实现递归的过程-Y-combinator solve a fibonacci series to achieve, the realization of the non-defined function name to achieve the process of recursive
jichu1
- Fibonacci数列是通过知道前两项算出后一项，依次计算下去而得到的一组数列；此道题使用简单变量“数据平移”方法来求出Fibonacci数列的第n项（的具体项值）并显示在屏幕上（正整数n通过键盘输入）。-Fibonacci series through to know the latter to calculate the first two, the calculation will be followed by a group of series This questions the u
thread_pool
- 线程池调用实例—求斐波那契数（vs实现)-Examples of the thread pool to call- for Fibonacci (vs2005 )
Fibonacci_recursive
- Fibonacci recursive code
shujujiegou
- 数据结构课程，里面有冒泡法排序，八皇后，斐波那契序列等程序-Data structure courses, there are bubble sort method, eight Queen' s, Fibonacci sequences, such as procedures
tutor51mcu
- EMBEDDED WORKBENCH TUTORIAL A simple C++ tutorial that uses fibonacci objects. It creates two objects and extracts two sequences of fibonacci numbers. To demonstrate that the two objects are independent of each other, the numbers are extr
thinkpad
- 本人原创的一个人和电脑互取苹果的游戏程序，核心是Fibonacci数列，供学习c/c++和数据结构的新手学习，以增强学习兴趣和热情。-I have an original and Apple computers and take the game procedures, the core is the Fibonacci series for learning c/c++ and data structure of new learning, to enhance the interest an
fibo
- The Fibonacci sequence is formed by adding S to a pattern of length n − 1, or L to a pattern of length n − 2.-The Fibonacci sequence is formed by adding S to a pattern of length n − 1, or L to a pattern of length n − 2.
Fibonacci
- Fibonaci implementing in VC-Fibonaci implementing in VC++
fib
- 此文件夹有两种代码 一为普通方法叠加 得出第n个斐波那契数 另一个用递归的方式得出-This folder there are two kinds of code to a draw for the general method of superposition of the first n-Fibonacci another way to draw recursive