hash排序，用hash法进行字符或数字的排序。-hash

C++语言对字符串对象进行各种操作的子程序，对运算符的重载，实现对字符串方便的各种操作。-C language string object to the operation of various subroutine, right Operators of heavy realize the convenience of a string operation.

该源码实现二叉树的模拟，运行时图片已经放在压缩文件夹下。-The realization of the source tree of the simulation, run-time image compression has on the folder.

一个的消防队管理系统的例子.己用在了实际的消防业务管理中.-a fire brigade management system examples. Others used in the actual fire service management.

图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship

*********************************************************

有各种排序算法，比如直接排序，快速排序，希尔排序和选择排序，二叉树排序，链表排序-There are various sorting algorithms, such as direct sequencing, Quick Sort, Hill sort and select sort, tree sort, sort list

应用背景此源代码将保存到用户表前检查该用户名可用性。这很重要，这样用户可以触发，如果数据已经存在。这是使用Ajax，所以它不会刷新页面，显示响应如果存在或不。希望它能帮助。谢谢你。关键技术技术和组件的选择：1 PHP2。MySQLjQuery的Ajax 3 /HTML 45 CSS6 Ajax7。自举

实现哈夫曼编码译码，可以实现，本实验可以实现编码，译码，打印哈夫曼数，等-There is a chance to appreciate different ways of life.

建立带表头结点的单链表，打印所有结点的数据域；输入一个值，若某个结点的数据域为该值，则在其后插入另一个新结点，若无此结点，则在表尾插入新结点，然后打印；给一个值，删除结点的数据域是该值的所有结点，然后打印。（表生成时可用前插法或后插法）-table with the establishment of the first node of a single linked list, print all nodes of the data domain; An input value, If a node"s data fields for the values, and subsequently inserted in a new node, in the absence of such nodes, at the end of the insertion of a new form nodes, then Print; to a value of the node to delete data domain is the value of all the nodes, then Print. (Table Generation available houses or after interpolation)