资源列表
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
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.
kmt
- 用c++实现的KMP算法。很高效很实用的哦-Using c++ to achieve the KMP algorithm. Very efficient practical Oh
sqlist
- 顺序表的基本操作，插入，删除和输入输出等操作-The basic operation of the order of the table, insert, delete, and input and output and other operations. . . . . . .
m
- 输入广义表表示法表示的二叉树的字符串，以#作为字符串结束标志，将广义表形式的字符串创建为链式存储结构的二叉树，并先序、中序和后序遍历该二叉树，输出先序、中序和后序遍历的序列 -Enter the generalized form of binary notation string, with# as a string end marker, the generalized form of the string table storage structure to create the binar
Hanoi
- 用c实现汉诺塔,利用了函数的递归调用及相关数据结构的知识。-Tower of Hanoi with c implementation, using a recursive function calls and associated data structure knowledge.
301-25-6-7
- 编写函数isSubset()用于判断链表L1中的每个数据元素是否都在链表L2中出现过，若是，则返回真，否则假。-the function is subset() ,it is used to judge if data in list L1 appears in list L2.
countingsort
- 《算法导论》第三版中计数排序伪码的C语言实现-"Introduction to Algorithms" third edition counting sort pseudo-code in C language
0-1package
- 0-1背包问题，C++编码,0-1背包问题的经典解决办法-0-1 knapsack problem, C++ ,0-1 encoding classical knapsack problem solutions