二叉树的遍历实现：

用C做的括号匹配程序,可以检测用户输入的括号是否匹配并给出提示-C matching brackets do procedures, the user can input the brackets and whether the match is suggested

数据结构中的贪心法装箱问题，结果给出装箱的办法和每个箱的容量。-Data structure in the bin-packing problem greedy method, the result is given packing methods and the capacity of each box.

利用Linklist实现超大整数之加减乘除-Linklist achieve large integers using the Math

用循环链表解决约瑟夫环问题。对学习循环链表有很大帮助-By cyclic list Joseph Central problem to solve. Learning cycle has a great list to help

八种排序的方法,利用VC++实现,值得借鉴-eight ranking, using VC, which is worth learning from

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

迷宫程序,C++实现 一个用VC写的关于迷宫的程序-maze procedure, C to achieve a VC was on the maze procedure

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

应用程序,面向课程设计-applications, design-oriented courses

该程序用格雷码来生成组合数序列,它比一般的方法要快,这是由格雷码的分布特性所决定的.-the procedures used to generate Gray code sequence portfolio, it generally means than to be fast, it was a Gray code distribution by the decision.