搜索资源列表
Fibonacci_number
- 输入n,输出费波那契数列 1~n 项 Input a number n and then output Fibonacci numbers from the first to the nth Fibonacci_number2: 输入 n ，输出第 n 项 Input n and then output the nth number -Input a number n and then output Fibonacci numbers from the first to the
longest_sequence
- 算法分析与设计的最长子序列问题，输入一定数列，系统会自动输出该序列的最长子序列长度-Algorithm analysis and design of the longest sequence problem, the importation of certain series, the system will automatically output the sequence of the longest sequence length
permutation
- C/C++程序，入门级。 获得数列或者字母序列全排列的方法。 练手的小程序。-C/C++ Procedures, entry-level. Access series or sequence of letters with the whole approach. Practicing hand applet.
RandQuickSort
- 随机快排，利用随机算法，搜索一个数列中的特定元素。期望时间复杂度要比快排小。-Algorithm using random search of a series of specific elements. Expect the time complexity faster than the small platoon.
Fibonaccisequence
- 个函数的功能是构建一个 n 项的菲波那契数列-A function of its functions is to build a n of the Fibonacci series
erchashu
- (1)以回车( \n )为输入结束标志，输入数列L，生成一棵二叉排序树T； (2)对二叉排序树T作中序遍历，输出结果； (3)计算二叉排序树T查找成功的平均查找长度，输出结果； (4)输入元素x，查找二叉排序树T，若存在含x的结点，则删除该结点，并作中序遍历(执行操作2)；否则输出信息“x不存在”； (5) 输入元素x，查找二叉排序树T，若整棵树不存在含值为x的结点，则插入该结点，并作中序遍历(执行操作2)；否则输出信息“x已经存在”。 -(1) to return ( &#
train
- 模拟堆栈输出从1到n的所有可能输出序列，并输出这些数列的总数-failed to translate
2
- 二分检索数列，用c语言实现，通过了测试．完全达到设计要求．-binarysearch a string
fractional
- 题目：有一分数序列：2/1，3/2，5/3，8/5，13/8，21/13...求出这个数列的前20项之和-Title: There is a sequence of scores: 2/1, 3/2, 5/3, 8/5, 13/821/13 ... find this series the sum of the first 20
cd1
- 实现彩灯的自然数列、奇数列、偶数列、音乐数列的循环显示-To achieve a natural Lantern series, odd-numbered columns, even column, music, series, shows the cycle of
fibonacci
- 经典的斐波那契数列算法，使用c++语言编写。希望对大家有用-Classic Fibonacci sequence algorithm, using c++ language. Want to be useful to everyone
suanfa
- 算法的试验报告 包括斐波那契数列问题（内涵流程图等等）-Test report including algorithm Fibonacci sequence
输出斐波那契数列前 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)
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.)
斐波那契数列
- c语言解决斐波那契数列问题，本科远古代码