baiji

数据结构中的用kmp算法查找关键字，供初学者参考(Data structure using kmp algorithm to find the keyword reference for beginners)

c++用栈来实现迷宫求解（c语言数据结构）(c++ stack maze solving (c language data structure))

约瑟夫环，数据结构算法，挺有意思，看看，看看(ysphdfgfgf)

二叉排序树，可以实现插入，删除，查找，创建功能(Binary sort tree,you can achieve the insert,delete,search,create functional)

一个苹果走迷宫，支持最短路径寻路。可以使用方向键操作，也可以用户自己添加迷宫格式文件，生成迷宫图。(Apple Maze, shortest path routing. Can use the arrow keys to operate, the user can add their own maze format generated maze.)

说明：  一个实现外部排序的程序，其中gnerate.cpp为产生一个随机的文件，用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)

说明：  操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))

一个很好的银行家算法，能运行(A good banker s algorithm, will be able to run)

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values ​ ​ adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)