资源列表
bigint
- 不受计算机字长限制的大整数类BigInt, 能在BigInt之间、 BigInt与int之间能进行+、-、*、/、 等运算，能进行比较，能数字与字符转换。-Computer word length limit is not a big integer class BigInt, between in BigInt, BigInt and int can be+,-,*,/, among other operations, can be compared to numbers and chara
dall
- 一个关于利用回溯法求解旅行商问题的源代码，希望对你们有帮助-A retrospective review on the use of the source code for solving traveling salesman problem, want to help you
Gauss-Jordan
- 方程组的求解，主要是jordan方法，用于求解线性方程组-Equations and the main method is jordan
houcha
- 数值计算方法，将连续方程离散化，用插值方法，主要有后差，欧拉，前插等方法，这里是后差方法的代码-Numerical methods, discretization of continuous equations, with the interpolation method, mainly after the poor, Euler, forward runs and so on, here is the code after the poor way
oula
- 数值计算方法，将连续方程离散化，用插值方法，主要有后差，欧拉，前插等方法，这里是欧拉方法的代码-Numerical methods, discretization of continuous equations, with the interpolation method, mainly after the poor, Euler, forward runs and so on, here is the code for the Euler method
houla-houcha
- 数值计算方法，将连续方程离散化，用插值方法，主要有后差，欧拉，前插等方法，这里是欧拉后差方法的代码-Numerical methods, discretization of continuous equations, with the interpolation method, mainly after the poor, Euler, forward runs and so on, here is the code for the Euler difference method after
Gauss-sedier
- 数值计算方法，将连续方程离散化，求解最有解的迭代方法，这里是高斯赛德尔的代码-Numerical methods, discretization of continuous equations, the solvability of the iterative method to solve, here is the code of high Sisaideer
beibao
- 用动态规划的方法解0/1背包问题。用VC6编译运行正确。供参考-Using dynamic programming for solving 0/1 knapsack problem. Compile and run correctly with VC6. Reference
FFT
- 离散快速Fourier变换，适用于复系数.-Discrete fast Fourier transform for complex coefficients.
Subset
- ary[]{1,2,3,4} 求打印其的所有子集。这是关于【幂集】的问题。 【幂集】包括【全集】和【空集】。对于有N个元素的集(/ □ \)合，它的幂集个数有2的N次方个。 比如这个例子，数组有4个元素。那么用4个位表示每一个元素（假设从左到右表示1234吧），0表示该数不存在，1表示存在。 则： 0000表示空集｛｝。 0001表示｛4｝。 0010表示｛3｝； 0011表示｛3，4｝； ………… 1110表示｛1，2，3｝； 1111表示｛1，2，3，
P1
- matlab code pc audio encoders, my first and second order
P1_a3
- matlab code pc audio encoders, my first and second order