数据库设计指南

霍夫曼编码前缀编码Huffman Coding-Huffman Codeing

权限控件sdfsfsdagfadsgasdgads-sgfdsgsdfsdfsdfasdgfagagggag

《Visual C++.NET数据库开发经典案例解析镜像光盘》随书光盘代码。-visual c++.net

外部排序程序，foxpro的DBF文件中某个字段的程序，特点是可以指定排序内存大小，但可以排序超级大的文件远远超出机器内存，采用快速排序加失败树合并算法，排序中会产生很多临时小文件。修改后可用于任何文件字段排序。-External sort procedure, foxpro of DBF files in a field procedure, and there is a sort of memory you can specify the size, but you can sort super large files far beyond the machine memory, the use of quick sort algorithm plus the failure of the merger tree, sorting will produce many temporary small files. The revised document can be used for any sort by that field.

折半查找算法,实现对于一组数据的查找操作,利用折半查找法进行查找-binary search algorithm, to achieve a set of data for the search operation, the use of binary search method you

清华大学版的数据结构实验中利用链表编的多项式的加，减，乘的原程序-version of the experimental data structure used Listless series polynomials, plus or minus, by the original procedure

这是一个有序链表的生成和插入的源码。用C++实现。-This is an orderly list of the generation and insertion of the source. With C++ Realize.

Java 检测 distruibuidos 数据库, PHP 执行情况

最简单和最酷的方式来创建类似程序，可以做与 ListView 保存、 加载和修改多个条目与文本的文件的数据库。必须下载此，请参阅如何最简单的这种方法是

K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern