hash 文件操作（数据结构）

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

使用PB实现取得多网卡ip GetIP支持多网卡-More than the realization of the use of PB card adapter supports multi-ip GetIP

是一个用于管理公司avous we make Purchase of good sales order quote proforma模块的应用程序；

因为用mfc做了一个应用程序，需要在没有数据库的情况下，读取excel中的数据，需要注意的是要在文件名前面加上强制类型转换符L

开发环境：c++builder6.0 SQL server2-development environment : c builder6.0 SQL server

实现Haffman算法,有输入的接口,需输入字符及其权重,能自动生成Haffman编码-achieve Haffman algorithm, the input interface, the need to import characters and weights, can automatically generate code Haffman

比较六种排序算法，其中包括快速排序，冒泡排序等内容的速度以及空间复杂度。-Comparison of the six sorting algorithms, including quicksort, bubble sort etc. the speed and space complexity.

开发环境:VC++6.0+MFC 数据库:Oracle 8.0 请将oraclm.dll拷贝到运行文件的目录中! 要运行例子要先装Oracle 8.0，如果有什么问题，请看你机器上的Oracle安装目录下的mshelp/Oraclec.hlp。-Development Environment: VC++ 6.0+ MFC Database: Oracle 8.0 Please oraclm.dll files are copied to the run directory! To run the example of first installed Oracle 8.0, if there are any problems, see your machine to install the Oracle directory mshelp/Oraclec.hlp.

数据结构 数据结构 数据结构 数据结构 -data structure data structure data structure data structure data structure data structure data structure data structure data structure

这是为初学者提供的，可以在短时间内学会，只要你有耐心，只要你有恒心，你就会学会，真的一点也不难。只要你肯下功夫。