资源列表
pingguojiufeng
- 数学上有一种分苹果问题，此程序是对它的合理编程- there is a problem of apple problem, this program is for its reasonable programming
qiujinzhi
- 此程序可以很方便的实现各个进制数之间的灵活转换-This procedure can easily realize the flexible conversion between hexadecimal number
zhuanhuan
- 此程序可以很灵活的实现大小写字母之间的灵活转换-This program can be very flexible flexible conversion between the lowercase letters
duoxiangshi
- 自己编写的用链表实现的多项式，包括多项式的加法和乘法运算-I have written a polynomial with a linked list implementation, including the addition and multiplication of polynomials
Stack
- 用C++写的栈的实现算法，比较好用。其中的栈用两种方法实现，一个是顺序栈，用动态数组实现的；另一个是链式栈，用链表实现的。-Written by C++ stack algorithm, relatively easy to use. Stack them in two ways, one is the order of the stack, with a dynamic array implementations Another is a chain stack, using a linke
buildTree
- 二叉树是采用递归定义的，实现起来代码简洁并且它在具体的计算机科学中有很重要的运用，是一种很重要的数据结构，二叉树有三种遍历和建立的方式。-Binary Tree is a recursive definition, the code is simple to implement and it has very important applications in computer science in particular, is a very important data structure,
HuffmanTree
- 霍夫曼编码是一种编码方式，是一种用于无损数据压缩的熵编码（权编码）算法。用变长编码表对源符号（如文件中的一个字母）进行编码，其中变长编码表是通过一种评估来源符号出现机率的方法得到的，出现机率高的字母使用较短的编码，反之出现机率低的则使用较长的编码，这便使编码之后的字符串的平均长度、期望值降低，从而达到无损压缩数据的目的。-Huffman coding is a coding is a lossless data compression entropy coding (right coding)
Maze
- 利用递归法走迷宫，先试探，再回溯，代码简单，有意思-Maze recursive method, first tentatively, then backtracking, the code is simple, interesting
Queue
- 用C++写的队列数据结构，用两种方式实现的，一种是动态数组，另一种是链式队列。-C++ write queue with data structure implemented in two ways, one is a dynamic array, and the other is chain queue.
Qt_LST.tar
- 斯塔纳树算法的图形化表示，利用图形界面显示斯塔纳树的形状，能够通过鼠标事件添加节点/删除节点/移动节点/局部放大等等。开发环境为Qt-Smetana tree algorithm graphical representation, using the graphical interface display Smetana tree shape, can through the mouse events add/delete node/node mobile node/local amplific
AVL tree operations
- Contains programs for AVL tree operations like insertion, deletion, search etc
xhqueue
- 循环队列的实现，实现数据结构里的循环队列-Achieve the cycle queue data structure in the circular queue