搜索资源列表
fraction
- 1.自定义分数类fraction,使用该类可以完成分数的输入、分数的加、减、乘、除二目运算和一目减运算、分数的约分操作、分数的通分操作、分数的倒数运算、对两个分数进行六种比较运算、以及对分数的输出等操作。 2.改造上述分数类,将其中使用的普通函数尽量改写成运算符重载函数。如,可重载+、-、*、/、>、>=、<、<=、==、!=,以实现分数的各种运算。并且实现分数与整数的混合运算。 3.从分数类派生出一个用来描述整型的Integer类,完善整型类Integer,使其
mysql-connector-cPP-1.1.3.tar
- mysql connect 1.13版本的源代码,采用面向对象的思想对mysql的操作进行封装-mysql connect 1.13 version of the source code, using object-oriented thinking on the operation of package mysql
Prime_factors
- 输入一个数,对其分解质因数并输出。input:12 output 2*2*3 input:13 output 13 input:20 output:2*2*5-input:12 output 2*2*3 input:13 output 13 input:20 output:2*2*5
bestfitted-line
- 根据所给的点的坐标算出最拟合曲线的公式,并根据原来的x值算出新的y值。并将数据储存到一个data文件-A C++ programme finds the best-fitted straight line to the x and y values, and then writes the original x, y values and the new y values on the line (for each x) to a data file. X: 1.0000 2.0000
ex5
- C + + program to calculate the N-th member of the Fibonacci sequence and present the N-th member on the screen with the Fibonacci range. The number of members of the Fibonacci sequence N, is entered through the keyboard. Fibonacci retracement sequ
haxibiao
- 选取哈希函数 H(k)=(3k) MOD 11。用开放定址法处理冲突,di = i((7k) MOD 10+1) (i=1,2,3,…)。试在 0~10 的散列地址空间中对关键字序列(22, 41, 53, 46, 30, 13, 01, 67)造哈希表,并求等概情况下查找成功时的平均查找长度。-Hash function
13.11.27-MnS-Lab._C-language-Assignment-Sharp01_C
- this calculation code is for myself anybody can use it tell to be better
Calculater
- 本程序采用C语言编写,通过数组的形式,实现高精度加减乘除。进入程序之后,首先输入你要进行运算的算式个数,然后依次输入诸如 2/5 5/2 1/0 52/4 得到 2/5 0……2 5/2 2……1 divisor is 0 52/4 13-This procedure using C language, through an array of high-precision arithmetic. After entering the program, firs
sift-0.9.13-bin
- SIFT-HOG matlab source code for computer visualisation