资源列表
U8_34
- 最大匹配问题 原创代码 算法 数据结构-Original code algorithm for maximum matching problem data structure
U5
- U5_1.cpp 用非递归方法寻找多数元素 U5_12.cpp 模拟桶排序 每桶内分行出处 总体为递增序列-U5_1.cpp with non-recursive way to find the majority of elements in U5_12.cpp simulated barrels per barrel in order to increase the overall sequence of branch origin
u4
- u4.cpp 最小堆的创建 插入 删除 排序 + siftdown + siftup 预置数组大小为15 -u4.cpp the creation of the smallest heap insertion deletion sorting+ siftdown+ siftup preset array of size 15
TestNEWACBM2.0
- NewACBM 但是ACBM有两个问题要解决： 1：对于多个一样的key，只能返回最后一个。 2：同一个规则在数据中多次，则都返回 这两条都不满足目前的要求。必须改。在不更改acbm算法的前提下，更改外包类 第一个问题通过在初始化解决，记住相同key之间的关系。匹配后再将相同key对应的其他key编号返回u 第二个问题，对于ACBM返回的规则，进行去重 顺序：去重后，再将相同key所对应的编号返回 NewACBM 2.0 修改了前面的bug：当clean
BTree_src_vc6
- 这是一个VC++根据前序序列和中序序列生成二叉树的程序，并进行遍历。 很不错的参考程序。-This is a VC++ according to pre-order sequences and the sequence binary sequence generation process, and traverse. A very good reference program.
huffman_encode
- 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the r
huffman_encode
- 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the roo
bucket.tar
- bucket algorithm for sorting
Red-Black-Tree
- 红黑树（Red-Black Tree）是二叉搜索树（Binary Search Tree）的一种改进-Red-Black Tree
UASLIST
- source code for double linked list
states_compression
- 介绍状态压缩理论，使用熟练地位操作降低需要的存储空间，以使动态规划算法可行-Describes the state compression theory, the status of the use of skilled operators to reduce the storage space needed to enable the dynamic programming algorithm is feasible
ReFunc
- 递归的C++代码实现，学习c++者可参考学习！-Recursive C++ code to achieve, learning c++ can refer to learn!