资源列表
numberpaixu
- 关于分支为3的树，它的节点种类总数小于7，深度为3，全探索的源代码-With regard to the three branches of the tree, which is less than the total number of nodes of type 7, a depth of 3, all to explore the source code
HuffmanOptimalbinarytree
- 利用Huffman算法，构造最优二叉树，它是霍夫曼编码的基础。-Huffman algorithm is used to construct optimal binary tree, which is the basis of Huffman coding.
crc
- 自动完成CRC校验码的计算 1 010110001101 110011 可以得到: (1)index:5 pointing:1 101011 110011 011000 (2)index:6 pointing:0 110000 110011 000011 (3)index:7 pointing:0 000110 0 000110 (4)index:8 pointing:0 001100 0 001100 (5)ind
3-8-1
- 把10进制的整数和小数转换成二进制整数和小数-dddddddddd
quick.c.tar
- enhanced quick-sort algorithm with c
main
- 二叉树的递归中序遍历 数据结构和算法作业的小程序-Recursive in order traversal of binary tree data structures and algorithms operating in the small program
using-adjacent-matrix-to-store-graph
- 用C语言数据结构描述的演示用邻接矩阵存图的小程序-Described in C language data structures stored adjacency matrix of graph presentation with a small program
1115_001
- It is a bubble sort code.And show the result if the sort is done.Except it will show the result of three value if there is two same value at the end value, that it will show four value.Because the last two value is same.
a
- conjugate gradient 找最小值-conjugate gradient
tiankou
- 田口算法运用于公差优化里面，方便大家学习与应用。-Taguchi algorithm applied to tolerance optimization inside, facilitate learning and application.
JSlider-Example
- javaslidercode for java beginner
Binary-search
- 二分查找，递归算法，按字典顺序排好的n个字符串，查找给定的字符串，成功返回索引值，失败返回-1；-Binary search (recursive algorithm)