利用OLEDB以数据库的方式打开Excell文件，SQL语句同样适用

数据结构课程设计,表达式,用C语言实现,难度系数较高-data structure curriculum design, expression, using C language, the higher the coefficient of difficulty

一个企业物资管理系统,用MS SQL,数据库课设,-a corporate materials management system, using MS SQL, database based courses, Oh

这是一个TSP问题的限界算法，用C++编程的

约瑟夫环实现

昆士兰殷朝：数据结构（使用面向对象方法和C语言）

一个数据库课程设计里报刊订阅管理系统，包含几个角色用户，系统管理员，投递员， 有网页形式显示的界面

.Net显示了友好的人机界面，以及非常少量的原代码就能够完成所要的功能-. Net shows the friendly human-machine interface, as well as a very small amount of the original code to be able to complete the function of

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

数据结构C++代码-data structure C code

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.