LR(0)

模拟枝晶生长，在统计学常用的一种算法，对随机理论有帮助。(Simulation of dendritic growth, the statistics used an algorithm, the stochastic theory.)

提供字符串方法，大家面试可以用，包括找出对称字串(Some string function)

图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

迷宫问题，利用随机数自动生成迷宫，并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user. 双语对照 )

说明：  一个用VS2008编写的冒泡排序算法演示程序，数组都是随机生成的。(Bubble Sort)

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

Dijlstra算法 对任意图，选择合适的数据结构表示图，在此基础上实现求解最短路径的Dijkstra算法(Dijlstra algorithm to arbitrary map, select the appropriate data structures that map, on this basis to achieve solution of the Dijkstra shortest path algorithm)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

说明：  简单的数据结构算法 在POJ上的题目 利用C++实现(Simple data structure algorithm in POJ on the subject using C++ Implementation)