dbf文件的读写类。它直接对dbf文件进行文件级的操作，没有索引...

这是一个数据结构常用的算法叫huffman编码.是对一棵二叉树进行huffman编码的算法-This is a common data structure called Huffman coding algorithm. For a binary tree for Huffman coding algorithm

数据结构课程设计 B-树 等 希望对大家有帮助-Data Structure Course Design B-trees, etc. We want to help

墨香完整数据库 如果哪位大大有 请你 send edwinking094@gmail.com 给我因为我的墨香数据出问题 急找大大帮助我~

This program use for ExpEvaluation

数据结构停车场问题-data structure parking problems

哈夫曼树算法 根据给定的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

计算大数阶乘，可以在1秒内计算出10000以上的整数阶乘-calculated factorial majority, in a calculated within seconds above 10,000 integer factorial

我编的学分管理程序,安装包原代码都有!VB入门的好东西-I made the credit management process, the installation package are the original code! VB entry of the good things

实现md5文件电子签名，md5hash值计算，比较文件，自己可扩展功能实现几个文件对比，从而找出重复文件-Md5 files to achieve electronic signature, md5hash calculated to compare documents, they can extend the functionality to achieve a number of document comparison, and to find duplicate files

本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.