资源列表
a+b
- 实现了两个大数的加法，速度很快．最大可以是５００位数的相加-realized the majority of the two Adder, very fast. It is the largest of the median combined 500
yakebidiedaifa
- 数值分析算法雅可比迭代法，用C语言实现。-numerical analysis algorithm Jacobi iteration, using C language.
1915
- poj1915求移动棋子到特定位置的最少次数,BFS经典题目-poj1915 for mobile pawn to a specific location of the minimum number, BFS Classic Title
cell
- 元胞自动机，实现一个元胞自动机的小程序，-Cellular Automata
nnpid
- MATLAB编写的神经网络程序，虽然简单但是很基础-Neural network program written in MATLAB, is simple but very basic
ZeroLagMACD.mq4
- Metatrader 4, non lagging MACD indicator to be used in Forex trading.
Paradox
- SAT-2 solution by Tarjan Algorithm / problem from spoj
3
- 输入三个整数x,y,z，请把这三个数由小到大输出。 1.程序分析：我们想办法把最小的数放到x上，先将x与y进行比较，如果x>y则将x与y的值进行交换， 然后再用x与z进行比较，如果x>z则将x与z的值进行交换，这样能使x最小。-Enter three integers x, y, z, please these three the number of small to large output. A program analysis: we want to a
FOURIER
- IDL傅里叶编程 傅里叶函数是指任何一个函数F(x)都能用正弦函数或者余弦函数及他们的组合关系式表示出来。-The IDL Fourier programming the Fourier function refers to a function F (x) of sine function or cosine function can be used and their combination relationship represented.
space-station-shield
- zoj 题中space station shield 题的源码和注释-space station shield s solution for ACM training
RK4
- Ordinary Differential equation.
lab
- 对于初始给定的数组,通常存在多个长度大于1的已自然排好序的子数组段.例如,若数组a中元素为{4,8,3,7,1,5,6,2},则自然排好序的子数组段有{4,8},{3,7},{1,5,6},{2}.用一次对数组a的线性扫描就足以找出所有这些排好序的子数组段.然后将相邻的排好序的子数组段两两合并,构成更大的排好序的子数组段({3,4,7,8},{1,2,5,6}).继续合并相邻排好序的子数组段,直至整个数组已排好序。-For the initial given array, usually pre