搜索资源列表
fibonacci系列打印
- 该程序是一个有关fibonacci数列的打印问题 其中的一个功能是能修改生长周期 虽然很简单但不是每个人都会做的哟-that the procedure was a Fibonacci series, the printing problem which is a function of the growth cycle would amend Although very simple but not everyone will do yo
JAVA递归
- 这是一个递归结构求斐波那契数列中的数列中的前10个数。-This is a recursive structure for Fibonacci series, the series of 10 numbers.
求Fibonacci数程序设计任务书1
- 打印数列问题,可以由用户直接键入N值,通过程序计算来求比较大的数列-Print series, users can directly type N value, calculated by the pursuit of big series
新c++我们的呀
- 按时org,开放的网络天书! 基数排序是这样实现的: 假设需排序数列的取值...如果化成比较树可以知道,这样的排序算法复杂度的下限是O(N*lnN),而基数排序没有比较元素,所以所需排序时间就少了,我们... www.cnic.org/wiki/鍩烘暟鎺掑-time org, open network hieroglyphics! Sort base is achieved : a few assumptions need to sort out ... If the value into
findkth
- 基于快速排序思想的找一给定数列的第k大个数-based on rapid sequencing of thinking for a given series of large number k
num_guess
- 猜数字，给定六个数列的生成公式,随机地从上述数列中选取一个作为本轮游戏的数列，并从该数列中随机地选取连续地三个元素，请用户猜该数列的下一个元素是什么？-tones, given the series of six generating formula, random from the series were selected as a game of this round of the series, and from the series of randomly selected to thr
xianxingbiaocharu
- 这是数据结构的线性表插入实验,功能:首先输入数列,然后选择要插入的位置即可!-This data structure is a linear scale experimental inserted, function : First of all imported series, and then choose the location to insert can be!
Anti-primeSequences
- 判断数列相邻n项和是否为和数，其中数列可有1000项，n可到10
ShiftLiner
- 该程序用于实现密码学中的线性反馈移位寄存器的模拟，本程序以5级为例，并可以判断输出数列的周期
MIPS汇编 fibonacci数列
- 一个求fibonacci数列的程序
输出斐波那契数列前 n项
- 通过输入数值n,输出斐波那契数列前 n项(Through the numerical input n, output Fibonacci numbers before the n)
韩信点兵
- 验证斐波那契数列 波波各方面各式各样特vjjfulj规范国家规定下雨(fdb sd fngn etf dbd db tbgf vxf erv dt yth)
菲波那契数列
- //指的是这样一个数列： 1，1，2，3，5，8，13，21…… //这个数列从第三项开始，每一项都等于前两项之和(refers to such a sequence: 1, 1, 2, 3, 5, 8, 13, 21...... This series from the beginning of the third /, each of which is equal to the sum of the preceding two terms)
Fib2
- 递归和非递归两种方式实现Fibonacci数列算法。。。(Recursive and non recursive two ways to achieve)
01 斐波那契数列
- 斐波那契数列程序的实现方式，C++程序。。。。。。。(The Fibonacci program)
fibo
- 斐波那契数列,简单地说,起始两项为0和1,此后的项分别为它的前两项之后。本算法使用递归算法实现。(The Fibonacci sequence, simply said, starting two to 0 and 1, then were the top two after it. This algorithm is implemented by recursive algorithm.)
斐波那契数列
- 能够实现斐波那契数列，阿特姆郎数和汉诺塔游戏步骤的产生，用PYTHON语言编写，简介实用(Which can realize the Fibonacci sequence)
斐波那契数列用循环队列解决
- 本代码提供将斐波那契数列用循环队列来解决的方案。(This code provides a solution to the Fibonacci sequence using a circular queue.)
斐波那契数列
- 斐波那契数列源代码，是当前最完整的，供大家分享，绝对简单(Fibonacci sequence source code, is the most complete, for everyone to share, absolutely simple)
斐波那契数列
- c语言解决斐波那契数列问题，本科远古代码