把数据库中已经存在的数据通过网络发送出去，实现数据共享...

倍增法构建后缀数组 求最大重复子串的C程序-Constructing the suffix array multiplication seeking to repeat the largest sub-string C-program

数据库设计60个技巧-Database design skills 60

我们开发的系统实际上基于三个主要模块。 > 通过打印的所有输入/输出活动记录指纹机上 > 标记出勤 > 消息提醒系统，向每个签入或签出的学生家长。

三种排序方法的动态演示，可以同时开启多个线程，同时用不同的方法进行排序，直观的判断不同算法的排序效率。-three sequencing method of dynamic presentations, it also opened a number of threads, in addition to the use of different methods for sequencing, intuitive judgment different sorting algorithms efficiency.

数据结构的八皇后问题-data structure of eight Queens

用VFP编写的报亭管理系统-VFP prepared by the newsstand Management System

C、C++语言实现的数据结构重要算法和程序 比较全。-C, C language data structures and algorithms important procedure is all.

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

delphi中使用ADO的源代码-use of the source code for ADO

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