用vc基于数据库编程源代码

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

一个管理系统全部-a management system for all

遍里数据库集合里的数据-times database, the data pool

任意阶一次幻方生成器 < 常用算法与数据结构 >-arbitrary order a magic square generator lt; Common algorithms and data structures gt;

MS ACCESS 数据库文件的压缩 Delphi 实现-MS ACCESS database file compression Delphi realize

蒙古文输入法源码，难得啊！望少数民族同学注意-Mongolian input source, a rare ah! Looking to minority students

Dissenyo de una BBDD con ficheros en java

本程序包实现了各种内排序功能，可以作为头文件库使用，封装好，强度大-the package to achieve a ranking within the various functions, as can the use of the header files, Packaging, and intensity

PB的数据窗口的例子,有约会,K线图等等,由此可以学习国外高手的编程技巧与经验-PB data window examples are dating, K map, etc., which can learn from foreign experts in the programming skills and experience

数据挖掘（概念与技术）书上的apiori算法实现。apiori剪枝算法使用候选项集产生发现频繁项集。-Data Mining (conceptual and technical) in a book apiori algorithm. apiori pruning algorithm uses candidate item set generated frequent itemsets found.