资源列表
huofuman
- 霍夫曼编码的基本方法是先对图像数据扫描一遍，计算出各种像素出现的概率，按概率的大小指定不同长度的唯一码字，由此得到一张该图像的霍夫曼码表。编码后的图像数据记录的是每个像素的码字，而码字与实际像素值的对应关系记录在码表中。-Huffman coding method is first scanned image data again, to calculate the probability of a variety of pixel specify a different length uniq
gray
- Gray码是一个长度为2n的序列。序列中无相同元素，每个元素都是长度为n位的串，相邻元素恰好只有1位不同。用分治策略设计并实现一个算法对任意的n构造响应的Gray码。-Gray code is a sequence of length 2n. No similar sequence elements, each element is n-bit string length, the adjacent element is only a difference exactly. With sub-r
MatrixMultiply
- 算法设计与分析 王晓东版的 矩阵连乘的动态规划法和备忘录法的实现-Algorithm Design and Analysis Xiaodong version of the matrix continued by the dynamic programming method and the realization of Memorandum of Law
data-structure-flash
- 关于各种数据结构算法的flash演示，有助于对数据结构的理解，超级好！-These are flash that about data structure.
part5
- 数据结构c++数据源代码，涵盖了基本的数据结构代码第五部分-Data structure c++ source code, covering the basic data structure code Part V
Exercise-6
- SSD7 exercise 6. Provide your solution to the following in a file named normalization.txt. Note: The discussion in this exercise is independent of (i.e., completed unrelated to) the E-Commerce project described in the Appendix. The following tab
Cpp1
- 杨辉三角的显示，数据结构，比较戳的做法。-Yang Hui triangle display, data structures, compare the practice stamp.
reference1
- 请编写算法，生成任意一个集合的幂集。集合元素用1，2，3，…表示，采用线性表存储。 例如：若集合S={1, 2, 3}，则其幂集为： {1}, {2}, {3}, {1, 2,}, {1, 3,}, {2, 3}, {1, 2, 3} -computing power set
8queens-problem
- 八皇后问题并行算法及源代码（附N皇后） 八皇后问题并行算法及源代码（附N皇后）-Eight queens problem parallel algorithm and source code (with N Queen) Eight queens problem parallel algorithm and source code (with N Queen)
ZOJ1065-Robots
- ZOJ 1065 Robots.不算太难,比较麻烦而已吧.-ZOJ 1065 Robots. Is not too difficult, but it is too much trouble.
sensor
- 智能车的光电组参考程序，此程序可以使飞思卡尔光电组的车子能跑起来，已经过测试-Photoelectric set of reference procedures for the smart car
acm
- acm中常用的算法！ 有写很有难度！ 当然也有简单！ 可以入门也可以提高！-algorithm commonly used in acm! There are very difficult to write!