资源列表
24dian.tar
- 用python编写的24点程序，改进后同时可以计算寻找诸如(((1+2)*3-4)+5*6*7+8)*9 = 2007这样的解法-python with 24 points prepared by the procedures, improved for the same time can be calculated as (((1) * 3-4) 5 6 * 7 * 8) = 2007 * 9 this The Solution
Huffmancoding.rar
- 对文本文件进行huffman编码、解码 读取文本文件，并统计文件中字母个数 建立huffman树 对文件进行huffman编码 对文件进行huffman解码 ,Text documents huffman encoding, decoding to read a text file, and the number of statistical documents the establishment of letters of the document tree huffman
2
- 掌握树的有关操作算法 熟悉树的基本存储方法 学习利用树求解实际问题 -Master tree are familiar with the operation algorithm for the tree to learn the basic storage method for solving practical problems in the use of a tree
modular
- 用c++实现的检测是否为素数的问题，算法采用的是随机算法-Achieved with the detection c++ whether the prime problem, the algorithm uses a random algorithm
Huffman
- 构造哈夫曼树,求字符的哈夫曼编码,输出字符的哈夫曼编码.-Huffman tree structure, find the character of the Huffman coding, the output character of the Huffman coding.
duoxiangshixiangjia
- 程序的应用，求多项式的相加的算法，利用数据结构的思想。-The application process, find the sum of polynomial algorithms, data structures using the idea.
binary-tree
- 实现二叉树的各种遍历，层次遍历，先序遍历，后序遍历等-Realize all kinds of a binary tree traverse, LevelOrder Traverse , preorder traversal ,postorder traversal
Kruskal
- 求最小生成树，Kruskal算法实现，想学Kruskal算法可以参考一下-Find the minimum spanning tree, Kruskal algorithm, Kruskal' s algorithm can refer to learn about
tree
- 遍历树,用于存储节点信息及其他查找树操作,仅供学习参考-Traverse the tree, for storing information and other search tree node operation, only to learn information
heap
- 堆排序程序实现，c++语言描述。调整大顶堆等-Heap sort program implementation, c++ language to describe
erchashu
- 二叉树的建立与三种遍历Establishment with three traversal of a binary tr-Establishment with three traversal of a binary tree
QueueInitial
- 实现基于顺序表的顺序栈（数据结构定义+基本运算）-Sequence stack-based sequence table (data structures defined the+ basic arithmetic)