graph-DFS

马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)

说明：  图的相关操作：建立图，图的遍历，查找元素，删除元素等(Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.)

循环链表的应用 循环链表的应用 很方便的实现(cycle Chain cyclic chain of convenience Implementation)

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

说明：  四路归并排序，将原有的二路归并排序改编的四路归并排序(The four-way merge sort to the original way merge sort adaptation of the four-way merge sort)

冒泡优化： 如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行，优化之后1次就好，也就是说序列越接近于正常序列，改进之后的冒泡排序的次数就越少，这样会给一个冒泡排序算法带了很大的效率。 思想：添加一个boolean变量用来判断冒泡是否是已经排好了顺序，如果boolean的值为false，说明是已经排好了，如果boolean的值true，说明没有排好，继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency. Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)

实现折半查找，非递归形式，从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)

将一组数组转换为哈夫曼编码，使用数据结构中的二叉树功能实现(Convert an array to Haffman code)

简单选择排序，这是个解决排序问题的一个算法模型之一。(Sort simple choice, this is a solution to a scheduling problem, one algorithm model.)

说明：  100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)