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

一个压缩算法, 名字叫PPMD,压缩率比较高, 同时, 可以自行修改并编译,请各位研究算法的同僚一同研究.-a compression algorithm, named PPMD, higher compression ratio, and can make its own decisions and build, please algorithm research colleagues to study together.

伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree

使用powerbuilder开发的小型超市管理系统。 请查阅。-Use PowerBuilder to develop a small supermarket management system. Please check.

这是个操作系统的时间片转换代码 希望可以对大家有所帮补 ^_^-this is the operating system for time-code conversion hope you all have a right to help make ^ _ ^

这是一个用来管理一个运行系统权限的程序，它增加删除用户，也可修改用户的密码和权限-This is an operating system used to manage a permission procedure, it increases delete users can modify user passwords and permissions

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

包括窗体与界面、控件、系统、文件、图形图像、多媒体、数据库 、网络、动态链接库等-Including the form and interface, controls, systems, documents, graphics and video, multimedia, database, network, dynamic link libraries, etc.

对内存内连续区域的数据进行排序，排序采用了交换排序的方法-Continuous region of memory to sort data, sort order using the exchange method

关于图的一些基本操作，以及实现细节-map on the basic operation and the achievement of details

自动抄表计费系统、 基于 GSM。其我的项目。bt 不幸的是我可以没有准备好到AT89S52 微控制器方案......，所以请能 at89s52 microcontrollr 编程数据......plz 帮我