本源码为图书管理系统，实现了密码登陆管理，图书基本信息的录入、修改、删除、查询，读者基本信息的录入、修改、删除、查询，实现了自动从系统取得借书时间，自动生成还原...

计算机模拟考试3级网络技术笔试-computer mock examinations three network technology quiz

merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.-merge sort give a set of S n integers and anot her integer x, determine whether or not there exits two elemen ts in S whose sum is exactly x.

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

vb做的-教学计划安排与排课系统-vb do-teaching plans and Timetable

sms develop use kfxt and mscomm and suce-sms develop and use kfxt mscomm and suce

这是数据结构的哈夫曼的实验报告-This is the data structure of the experimental report Huffman

数据库读写的代码，能够访问ACCESS数据库，自动创建，并具有筛选功能，需要用户名匹配才能修改，撤销修改等功能！

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

c++下的AOV实现-c achieve the AOV

如何分离一个顺序表里的0元素和非0元素？本程序展示了三种高效算法并比较他们之间的性能-How to separate 0 and non-0 element in a squencial list? The program shows three effective algorithm and compare their performances.