quick_sort

汉诺塔代码,从第一个木桩中,把所有盘子从大到小搬移到第三个木桩中.-HANOR code from a wooden blocks, all the dishes to the smallest movement pickets were third.

数据结构教程 C-data structure tutorial for c

C++经典大整数实现,加减乘除.输入输出-C classic large integer, the arithmetic. Input and Output

通过该程序实现huffman编码，解码。输入一段字符串，统计字符出现频率，输出huffman编码。输入一段编码，根据预先设定的解码方式进行解码。-Through the process to achieve huffman encoding and decoding. Enter a string, statistical character frequency, the output huffman coding. Enter a code, based on pre-set decoding method to decode.

另外一个可以实现线性表的程序，简单的操作，值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)

数据结构课程设计，多种内部排序的效率分析(Data structure course design, the efficiency of a variety of internal sorting)

数据结构作业题，堆栈和队的使用（大写字母表示魔王语言的词汇；小写字母表示人的词汇语言；魔王语言中包含括号）-Title data structure operations, the stack and force the use of (capital letters that devil language vocabulary lowercase letters that people s vocabulary language devil language contained in brackets)

操作注意事项 （1）本系统管理员用户名为：tsoft，密码为：111。 （2）实例执行文件位置：login.asp。 （3）本系统有两种操作用户：其中管理员为超级用户，具有所有权限；普通用户没有添加操作员及删除操作员的权限。 （4）在运行本系统中的“年销售额分析”模块时，需要安装Visual Basic 6.0软件。 （5）在配置IIS服务器时，需要将本程序所在路径设置为网站的根目录。 -Handling Precautions (1) The system administrator user name: tsoft, password: 111. (2) examples of implementation of the file location: login.asp. (3) The system has two kinds of operation of the user: one administrator for the super user has all the authority ordinary users do not have to add operators and delete operator privileges. (4) the system is running in the " sales analysis" module, you need to install Visual Basic 6.0 software. (5) Configure IIS server, you need to set up this program where the path to the root directory for the Web site.

这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.

求最长公共子序列。本算法使用动态规划算法，解得最长公共子序列问题。(Find the longest common subsequence. The algorithm uses a dynamic programming algorithm, the solution was the longest common subsequence problem.)