在线幻灯片产品

R树与B树的混合树，在这个程序里面可以直接用R树和B树-R and B-tree tree of mixed tree, in the inside can directly with the R and B-tree tree

高级算法里的排序讲义ppt。sorting- In high-level algorithm arrangement printed lecture ppt. Sorting

字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构-Dictionary tree algorithm, can be very convenient multi-tree, and find very convenient is the design of ACM algorithms commonly used data structure

是一个C语言的KMP代码， 包含可执行文件。-Is a C language KMP code, contains an executable file.

这是一个练习链表的扑克牌程序，可以自动发牌，比较大小。如果想和计算机对战，只需要稍微改动一下程序即可。-This is a practice Chain cards procedures, it will automatically licensing, size comparison. If you want to, and computer war, only slightly modifying procedures.

这是汉诺塔一个演示程序，使用VC++开发的-Tower of Hanoi This is a demo program, the use of VC++ Development

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri

Redhat8的安装教程(文本安装方式)(-Redhat8 the installation guide (text installation) (

北京yd大学软件工程研究生的课程---数据库设计开发，，ppt格式-Beijing yd University Software Engineering postgraduate courses--- database design and development,, ppt format

无向图的最小生成树程序，还不错哦~供大家分享，有文字说明-Undirected graph of the minimum spanning tree procedure, but also good for your sharing ~ Oh, there are text