Huffman coding procedures small data structure

      极大限制了服务器应用程序的使用，本程序采用ICPQ，利用端口实现的聊天室系统，可实现多个用户同时在线聊天，源代码包含了一份官方的文档，并加有注释。

不带头结点的链式堆栈类,1、 定义并实现不带头结点的链式堆栈类，除构造和析构函数外，成员函数还有入栈、出栈、取栈顶元素、判断堆栈是否非空，头文件为“nohead_LinStack.h”。-node does not take the lead in the category of chain stack, 1, and the definition does not take the lead in realizing the chain nodes stack category, In addition to construction and destructor function, the members also function stack, stack up and stack elements for judging whether non-empty stack, The first document as "nohead_LinStack.h."

(1) 初始化。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存于文件hfmTree.txt中。 (2) 编码。利用已建好的哈夫曼树，对文件ToBeTra.txt中的正文进行编码，然后将结果存入文件CodeFil.txt中。 (3) 译码。利用已建好的哈夫曼树将文件CodeFile.txt中的代码进行译码，结果存入文件Textfile.txt中。 -Huffman encoder/decoder

求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.

vb用sql语句操作数据库-vb used to operate the database sql statement

数据结构中线性表的合并链式实现，VC++实现的。-Data structure in linear chain realize the merger table, VC++ Achievable.

本代码演示了使用MS SQL和delphi进行简单数据库开发，一个简单的学生成绩系统，附近中有数据库创建的文本-This code demonstrates the use of MS SQL, and delphi simple database development, a simple student achievement system, there is a database created in the vicinity of the text

unix上的ODBC实现-unix on ODBC to achieve

数据结构，用栈实现表达式求职，是改进后的算法-Data structure, with the stack to achieve expression for employment, is the improved algorithm

C#中数据库的链接代码，包含各种常用的链接代码-C# code in the database links, including links to a variety of commonly used code for