建立VCL连接数据库,也是初学者的好东东，忘了如何写的回头看看也不错...

对文件中的数据进行哈夫曼编码和解码,列出给定数据的权重,列出左右孩子和父亲节点的列表,对任意数据进行进行哈夫曼编码和解码-to document the data Huffman coding and decoding, data presents given weight, shown around children and the father node list of arbitrary data for Huffman coding and decoding

这是一个简单的使用在 PHP 和 Mysq 中设计的数据库系统。使用名称应创建 （用户） 表中，一个人可以登录之前。使用 library_system 作为数据库的名称和创建转储文件中所列的表。祝你好运。

利用桶排序给数组a排序，建立的桶为b和e，其中b为含有十万个桶，e为只有一个链表的桶，然后对b和e使用插入算法排序，比较两种算法的时间，b需要40毫秒左右，e需要9到10分钟。-use barrels a ranking to the array, in order to establish the barrels of b and e, b to contain 100,000 barrels of only one e Chain barrels, and then to b e used to insert sorting algorithm, the algorithm for comparing two hours, b needs about 40 milliseconds, e needs 9 10 minutes.

数据结构单链表的实现,包含链表元素的删除,查找,插入-single linked list data structure to achieve List contains elements delete, retrieve, insert

基于数据库设计一个网页,实现基本功能：增删改、查询、统计报表的功能要有.管理信息-A. General Queries- The system should be able to retrieve useful data stored in the database. B. Statistics Collection- The system should be able to generate useful statistics information. C. Modification of Data- The system should provide interface for the store managers to add, remove and update the data in the database. D. Dealing with special events in the system. Your system should be able to handle real life situations that may arise from running the business. E. You are required to implement a web user interface for your system. F. The user interface should be intuitive and effective to use. G. Please bear in mind that a casual user should not have problems to check some simple information. H. The system should provide an English UI. You can also design multi-lingual UI.

单线性链表操作 数据结构 演示 flash课件-One-way operation of the data structure of linked lists flash demo courseware

这是计算机专业硕士生课程《算法设计与实现》中讲到的模式匹配算法的实现，并且将该算法与KMP算法进行了比较。-It was the professional degree programs, "Algorithm Design and Implementation" referred to the pattern matching algorithm implementation, and algorithm and KMP algorithm are compared.

八皇后问题，用vc编写了一个可以解决八皇后问题的程序，实现了递归调用。-The eight queens problem, using vc write a means of solving the eight queens problem program to achieve the recursive calls.

该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it"s time complexity of O (n), but this sort known to be applicable to sort out the range, and if the upper and lower limits of the relatively large margin, space consumption is relatively large.

This code supplements the tutorial in Finite State Machines