hash

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(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.)

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

链表L，创建公有成员函数Split（A,B ），创建2个新表A,B，使的A 中含有L中奇数位置元数，B中含L偶数位置元数 (Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

用C语言实现的普通快速排序，和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)

数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)

经典的 数据结构问题 八皇后问题。问题是在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.)

简单的汉诺塔算法，采用归约算法的思想，实例是三个盘子，三个柱子(Simple HANOR algorithm)

这个是C++编译的单链表，其中包括多种链表操作，是很好的学习资料。(This is a C++ compiler single linked list, which includes a variety of linked list operations, is a good learning materials.)