Maze

一个MFC编的算法分析课程设计实验“重排九宫源码”(MFC compiled an algorithm analysis course design experiment " rearrangement kau kung source" )

数据结构线性表教学笔记，内容讲基础知识，没基础可以看看(Linear table data structure teaching notes, basic knowledge content says, no base can take a look)

自己编写的floyd 最短距离求解程序。实用简单。gcc (Floyd shortest distance to write your own solver. Practical and simple. gcc)

说明：  《妙趣横生的算法》第三部分原书附带代码程序，绝对属实(&quot Algorithm for fun,&quot the third part of the original program with the code, the absolute truth)

数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)

排序程序,包含快速排序、归并排序、谢尔排序、插入排序。输出了比较次数和移动次数。(It is a sort program, including quick sort, merge sort, shell sort and insert sort.It outputs the compare times and movement times.)

数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)

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

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

数据结构相关代码，源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))