erchashu

X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)

数据结构 二叉树的操作，可以对二叉树进行最基本的操作，先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)

本代码主要实现了哈希表的设计，完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)

使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)

数据结构课程设计－－实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)

有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)

链表L，创建公有成员函数Split（A,B ），创建2个新表A,B，使的A 中含有L中奇数位置元数，B中含L偶数位置元数 (Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)

数据结构中链式队列和堆栈的循环用法，非常有用(Queue data structure in the chain and the cycle stack usage, very useful)

用VC++编写中值滤波的算法，具有图形界面(The algorithm of Filter ，which use VC++)

哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)