Form Login

通过输入一串英文（权值）来构建赫夫曼树，并在当前目录下打印赫夫曼图像

这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)

这是一份实验报告，用以验证和实现插入删除查询排列等数据库语言操作。-This is a test report to verify and insert a delete query to achieve ordered operations such as database language.

这是继一之后的第2个管理信息系统的案例 很不错的 大家来看看吧 -This is the second one after the first two MIS very good case we view Look here

用VC编写的读取SQL数据库的小程序-VC prepared by the reader SQL database small program

用C++实现的工资管理系统!这里用了数据结构中的链表!-Using C++ implementation of the salary management system! Here with a list data structure!

气泡排序，一个简单的排序10个数字，按从大到小排列-Bubble sort to sort a simple 10 figures, according to smallest order

代码提供顺序链表、链式链表和栈C语言实现版本，其中包括链表的初始化、插入元素、删除元素、获取元素、输出元素等操作。同时提供多项式乘法的实现代码。

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① 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

its about the radix sort technique