搜索资源列表
xuhanshu
- 利用虚函数手段,按照3种不同的计算方法来求出Fibonacci数列的第n项(的具体项值)并输出。具体地说,可通过在基类baseCla及其派生类fib1Cla、fib2Cla和fib3Cla中说明如下的同一个虚函数“virtual double fib(int n) ”,来实现求Fibonacci数列第n项值并返回的3种不同求解方法。例如,可设计并使用已经在第4和第5章的练习中所实现的求解方法:简单变量“数据平移”法、使用数组的实现法以及使用递归函数的实现法。-The use of virtual
fibonaci
- Fibonacci数列,已知一个Fibonacci数,能求出它的N值-Where Fibonacci sequence, a number of known where Fibonacci, can find its N
GM
- 基于灰色系统的预测,内涵数列预测和较难实现的包络预测-Prediction based on gray system, meaning the number of columns predictable and difficult to achieve the envelope prediction
Proj_2
- 此程序可以用选择排序,冒泡排序,快速排序,合并排序,堆排序来对数列进行排序,而且可以算出它的比较次数-yeah,it is really good!!!
class3-Fibonacci
- Fibonacci数列的递归和非递归算法,有详细注释-Fibonacci sequence of recursive and non-recursive algorithm, detailed notes
suanfa
- 算法的试验报告 包括斐波那契数列问题(内涵流程图等等)-Test report including algorithm Fibonacci sequence
Fibonacci
- 编写一个Java程序,用于输出并显示出Fibonacci数列的前20项。-Write a Java program for the output and demonstrate the Fibonacci series, the first 20.
c-code
- c语言经典代码,包括:打印图案 ,大小写字母的互换 整数因子 /*请编写一程序完成下面的功能:从键盘上任意上任意输入一个大于0且小于1000的整数,然后输出此整数的所有整数因子。如输入12,则输入1,2,3,4,6,12。*/ 插入后自动排序 /*原题:把一个整数插入到按由小到大排列的数列中,插入后仍然保持由小到大的顺序排列*/ /*指针,穷举法进行比较交换*/ 求数列 /*原题:已知一正整数递增等差数列,前5项之和为25,前5项之积为945,根据以上条件,请编写
longest_public_substring
- 用动态规划实现查找两个数列之间的最长公共子序列-Realization of dynamic programming to find the number of columns between the two longest common subsequence
2.3
- 求解Fibonacci数列的三种方法,一种用常规算法,一种用数组,一种用递归算法-Solving Fibonacci series three methods, a conventional method, an array, a recursive algorithm for
2-2
- 实现众数算法。 众数是数列中出现频数最高的数字。 实现从文件读取数列与数组长度,向文件输出结果与频数。-To achieve mode algorithm. Mode is the frequency of the number of the number of columns appear in the highest number. The number of columns to read from a file with the array length and frequency of
Fibonacci_series
- 1.讨论数列的变化规律。 2.讨论调和级数的变化规律。-1. Discuss the changes of the number of columns. 2. To discuss the changes of harmonic progression.
JAVA1_1
- 编写一个Java程序,用于输出Fibonacci数列的前20项。 提示:Fibonacci数列定义为:第一、二项的值为1,从第三项开始依次为前两项的和。 Fibonacci[0]=Fibonacci[1]=1 Fibonacci[i]=Fibonacci[i-2]+Fibonacci[i-1] (i>=2) -Write a Java program for Fibonacci series, the first output 20. Tip: Fibonacci sequence
144
- 递归经典简单例题,用于求解斐波那契数列相似的问题-a classical case of recurtion
Fibonacci
- 程序能够接收1~100之间的整数,根据接收的数值,计算其Fibonacci数,在屏幕上输出其值。Fibonacci数列的定义如下: Fib(1)=1 Fib(2)=1 Fib(n)=fib(n-2)+fib(n-1) -Program can receive an integer between 1 to 100, according to the received value, to calculate the Fibonacci number, the screen outp
paixu
- 数据结构各种排序实验报告,利用直接插入排序、冒泡排序、快速排序对数列进行排序。有随机生成数字-Experimental report a variety of sorting data structures, using a direct insertion sort, bubble sort, quick sort on the number of columns to sort. There are randomly generated numbers
Fibonacci
- 用3种不同的计算方法求Fibonacci数列的第n项,c++语言编写-With 3 different calculation method, to calculate Fibonacci series, the first n items, c++ language
work1
- 用MATLAB实现递推数列的卷积和FFT算法-Using MATLAB implementation of the FFT algorithm for recursive sequence
execise1
- 本程序为用户输入一个整数,程序会给出对应该位置的斐波那契数列的值。-This procedure for the user to enter an integer, the program will be given to the location of the Fibonacci sequence value.
EA_b
- 进化算法的一种 (1+1)EA的算法实现最优化求解 提供的示范函数为二进制数列求积累和-Opitmization method demo, based on (1+1)EA which belongs to Evolutionary Algorithm. An example function is provided as minimization of sum of a boolean array s bit multiplication.