员工休假管理系统

C++经典大整数实现,加减乘除.输入输出-C classic large integer, the arithmetic. Input and Output

算法：华容道问题的启发式搜索。寻求一种最优解的快速算法。-Algorithm: Huarong issues heuristic search.

数据结构中各种排序算法，数据结构中各种排序算法-data structure various sequencing algorithms, data structures of various Sort Algorithm

MSSQL图书管理系统，源代码+数据库文件+说明文档+报告-MSSQL library management system, database file+ source code+ documentation+ Report

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

数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0

数据结构中的AVL TREE的实现-data structure of the realization of AVL TREE

C语言编写的栈操作模板。包含栈的9种基本操作，从栈的创建、栈的判断到入栈、出栈操作，以及栈的删除等操作。-C language template stack operation. Stack contains 9 kinds of basic operation, from the stack to create, to determine the stack入栈, a stack operation, and stack operations such as delete.

VB编写的简单打印控件-prepared by the simple VB Control Print

一个octree algorithm 的实现CQuantizer.-The octree algorithm realize a CQuantizer.