migong

对于给定的n个字符串，请找出一种最佳的连接方式，使得采用该连接方式得到的字符串在所有连接的结果中，字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)

二查树遍历文件，可以用于程序测试，有喜欢的朋友要多多使用哦(Two check tree traversal file that can be used for program testing)

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)

输入迷宫行列数，1代表墙0代表路，之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

说明：  贪心方法是一种改进了的分级处理方法。它首先根据题意，选取一种量度标准。然后按这种量度标准对这n个输入排序，并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解，则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)

Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of ​ ​ data structures, file is relatively small and can be run directly)

POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

几个比较好的初级算法，初学者可以看一下思想，对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)