资源列表
概率统计
- 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
chaoshengbo.rar
- 用51单片机控制超声波，采用中断方式，用于小车的蔽障，超声波的距离在一米左右,51 single-chip control with ultrasound, using interrupt mode, the cover for the vehicle barrier, ultrasonic distance meters in a
FDTD
- FDTD code in Free Space with no absorbing boundary conditions.
nizhi
- 单链表的就地逆置 掌握数据结构中的一些基本概念。数据、数据项、数据元素、数据类型和数据结构，以及它们之间的关系-Single list of in situ reverse home master data structure of some basic concepts. Data, data items, data elements, data types and data structures, as well as the relationship between them
define_the_latter_table.txt
- 根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current si
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. .
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
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