example-program

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

说明：  子集和数问题.rar，用C++写的，可以运行(Subset of several problems. Rar, written in C++, you can run)

用银行家算法实现资源分配,Bankers algorithm to achieve the allocation of resources(Bankers algorithm to achieve the allocation of resources)

Monkeys and peach,Monkeys and peach(Monkeys and peach)

在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)

这是我在学习数据结构做练习时写的一个小程序，功能是在命令行下进行形如：23+34*3/4+(3*6+10)的四则运算，支持+,-,*,/,(,)进行整数运算。(This is a simple code about data structure.It uses to carry on four arithmetic operations with parenthesis.But now it only supports integer.)

使用很好的数据结构，程序运行效率高，界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)

该ppt包含了栈和队列的数据结构及基本操作，同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)

这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)

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