PHP的beginers

设计一个哈夫曼编码、译码系统。对一个ASCII编码的文本文件中的字符进行哈夫曼编码，生成编码文件；反过来，可将编码文件译码还原为一个文本文件。1.初始化。任意读入一个ASCII编码的文件，统计数据，建立哈夫曼树。2.编码。利用已建立的哈夫曼树给出每个字符的哈夫曼编码。3.图形化输出哈夫曼树中各结点以及哈夫曼编码。4.译码。利用已建立的哈夫曼树对输入文件进行译码并存储为.huf压缩文件。5.反译码。将huf文件译码为ASCII编码的txt文件，与原txt文件进行比较。

用KRUSKAL算法求最短路径,可以运行C++源程序-KRUSKAL algorithm used for the shortest path, you can run C++ source code

层次的非递归算法-level of non- recursive algorithm

简单的全排列与组合问题的递归解法，数据结构与算法中较基础的问题-simple combination with the full array of recursive method, data structure and algorithm based on the issues than

这是我的数据结构课程设计源代码，请务必按提示输入数据，该程序的功能是用链表实现多项式的四则运算。-This is my data structure course design source code, you must follow the directions to input data, the program"s function is used to achieve Chain of four polynomial operations.

从Visual C++中用Access自动生成报表-from using Visual C Access automatically generate statements

哈夫曼编码(Huffman Coding)以哈夫曼树─即最优二叉树，带权路径长度最小的二叉树，经常应用于数据压缩。-Huffman coding (Huffman Coding) ─ a Huffman tree that is optimal binary tree, with the right of the path length of the smallest tree, often used in data compression.

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution

算法，钱币组合。可设定钱币种类数量，找出组合种数。-Algorithm, coin combinations. Can set the number of coin types, identify the combination of species.

基于java开发的OS中经典PV算法：生产者和消费者算法的演示。-Java-based OS development of PV in the classical algorithm: algorithm for producers and consumers of the presentation.