FindMax

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

经典的 数据结构问题 八皇后问题。问题是在8*8的棋盘上放置棋子，要求每条直线上不能出现两个或以上的棋子。(The classical data structure problem Eight queens problem.Question is placed on the 8* 8 board piece, requirements on each line cannot appear two or more pieces.)

floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)

POJ141的源代码，以空间换时间，速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)

二叉树实现，整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)

实现栈的基本操作，建栈，进栈，出栈，数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)

利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)

实现经典问题老鼠迷宫，并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)

用于迷宫问题的解决用户根据根据要求进行设置即可在屏幕上显示(Maze problems for users in accordance with the requirements set can be displayed on the screen)

键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)