资源列表
3-LOCPOT
- 可以处理三维矩阵数据，三维数组的线性化处理，-#include<stdio.h> #define N 56 #define M 56 #define L 336 #define Leng 23.693 double V[N][M][L] void main() { int i, j, k double Z[L], ZL[L], S, A FILE*fp1,*fp2 if ((fp1 = fopen("LO
P-value
- calcule de la p-value en c#
hanoi
- 汉诺塔问题，这是一个古典的数学问题，是一个用递归方法解题的典型例子。-Tower of Hanoi problem, which is a classical mathematical problem, is a typical example of a recursive method of solving problems.
yuanchengxu.VCPP
- 用Runge-Kutta法求平板边界层的布拉休斯解-Blasius solution with Runge-Kutta method and the boundary layer
QuickSort.java
- A fast quick sort algorithm
Precision-multiplication
- 高精度乘法的Pascal源代码文件，求任意位数的乘法运算。-Precision multiplication Pascal source code files, find any digit adder.
triangles
- using this file to create a triangle
car_park
- Program to find optimal arrangement of car. Program to find optimal arrangement of car.
sushu
- 给出n（1<=n<=100000），问1到n之间有几个素数。 -Given n (1 < = n < = 100000), asked a few prime numbers between 1 to n.
Finite-difference-for-poisson-
- 用有限差分法编程求解泊松方程在网格结点处的值-Solving the value of the Poisson equation in a grid junction with the finite difference method Programming
approximate-entropy-matlab-program
- 通过近似熵函数 提取数据特征并画出曲线，可以直接运行-By approximate entropy feature extraction data and draw the curve, you can directly run
Bijan_ANFIS_OPT
- ANFIS optimization to obtain best radius