资源列表
概率统计
- 2个关于概率统计的C程序，以及示例，来自《C语言数值常用程序》，所以程序均经过本人测试可以正常使用！-two on the statistical probability of C procedures, as well as examples from the "C language commonly used numerical procedures," and so I have to undergo testing can be used normally.
Gauss_Jordan_Elimination
- 使用高斯消去法Gauss_Jordan解方程式-use Gaussian elimination Gauss_Jordan solution formula
FDTD
- FDTD code in Free Space with no absorbing boundary conditions.
sort_merge_java
- sorts table of numbers using marge_sort algorithm
11
- 关于图结构的深度优先搜索遍历。。。输出搜索的遍历序列-On the graph structure of the depth-first search traversal. . . Output search traversal sequence. .
factlength
- factorial length find
8-REINAS
- Algoritmo de las 8 reinas
HuffmanFinal
- 掌握结构体、指针及二叉树的生成、遍历等操作掌握霍夫曼编码/译码的原理。-Master structures pointer and binary tree traverse the generation of operate the master Huffman coding/decode principle
To-solve-the-equation-solution
- 使用二分法不断循环，一直到误差很小。求近似解未知方程的零点-To solve the equation
FDM-for-differential-equation
- 有限差分格式的子程序以及用牛顿向前迭代的子程序-Finite difference scheme and Newton subroutine subprogram forward iteration
poiseuille_d2q9
- LBM方法中的D2Q9模型，对poiseuille流进行模拟，输出速度文件可用MATLAB打开-LBM method D2Q9 model, poiseuille flow simulation, the output speed of the file can be used to open MATLAB
HUFFMAN-CODING-TREE.cpp
- 构造一个具有n个外部节点的扩充二叉树，每个外部节点Ki有一个Wi对应，作为该外部节点的权。使得这个扩充二叉树的叶节点带权外部路径长度总和最小： Min( W1 * L1 + W2 * L2 + W3 * L3 + … + Wn * Ln) Wi:每个节点的权值。 Li:根节点到第i个外部叶子节点的距离。 编程计算最小外部路径长度总和。-Constructing a binary tree with n external expansion nodes, each external n