哈夫曼编/解码器

 ；文件O显示：读取数据从文件和cab可以传输您想要的格式。

根据图书管理的功能要求，结合学校图书管理的实际情况，系统分成以下若干模块：编目、典藏、流通、读者、查询、系统维护。-According to the functional requirements of library management, combined with the actual situation of the school library management, the system divided into several modules: cataloging, collection, circulation, reader, search, system maintenance.

h3h3h3面并不很精通。我最近看的书《分行与小波》《小波十讲》《小波变换与分数傅里叶变换》《工程小波变换》等。上面所写，一部分来源于书，一部分来源于自己的体会。所以希望-h3h3h3 surface is not very proficient. I recently read "branch and wavelet" "wavelet 10 stresses" "wavelet transform and scores of Fourier transform," "project wavelet transform." The above was written part from the book, from the part of his experience. I hope

求两个字符串的最长公共子序列，使用递归算法实现。-For two of the longest common sub-string sequences, using the recursive algorithm.

使用VC编写的约瑟夫环程序，简单明了，方便使用-Prepared using the VC Joseph Central program, simple and clear, easy to use

一个自己用C编的关于贪婪算法的例子，压缩包里带有原题目与原测试数据-they use a C series of examples of the greedy algorithm, compressed bundle with the original title and the original test data

K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern

输入人数，输入将要分配的工作数目，输入第i人干第j项工作的经费消耗，调用处理模块BackTracking输出最优分配方案。-Enter the number, type of job distribution to the number of people do i enter the first section of the work of j-expendable funds, call processing module output BackTracking optimal distribution program.

精心链表操作,对单向双向的链表操用实例，精当-carefully chain operation, a one-way pairs two-way linked list speaks examples of elder

根据先序和中序遍历的结果，重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree