数据库企业车间管理系统

一个有关HUFFMAN算法的演示 其中还有一些基于HUFFMAN的压缩-an algorithm for the presentation of which some compression on Speed HUFFMAN

vc编写的小型旅馆管理系统-vc prepared by the small hotel management system

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data node must be small (large) in the node data. Order traversal of binary tree that is the result of a sort.

线性表常用算法集合，含所有线性表基本的算法，与吴伟民编的数据结构书完全配套，用TC实现，经过运行。-linear algorithm commonly used pool table, table containing all the basic linear algorithms, and Xiulan WU Weimin series of the data structure was fully complementary with TC realization, after running.

自动导入文件到数据库,用于那些无法实时入库,定点时间入库的需求-Automatically import the file to the database, which can not be used for real-time storage, the demand for fixed-point storage time

用delphi实现的各种排序算法，图形界面，可实现插入排序、交换排序、选择排序、合并排序以及基数排序-used to achieve the various sequencing algorithms, graphical interface, insert can be realized, in order of ranking exchange, SELECTION SORT, the merger sort of base sequencing

BerkeleyDB，非常有名的开源嵌入式数据库系统,含完整安装包、文档和源码-BerkeleyDB, very famous revenue Embedded database system with a complete installation package, documentation and source code

堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子 算法平均时间复杂度: O(nlogn) -HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)

access2002宝典 超星格式图书-access2002 Superstar format books

JTDS驱动，好用的sql server驱动程序哦-sdfsofjesfjsljflsjfdsljfslfjsljflsjflsjfljdslfs