资源列表
BracketMatch
- 数据结构中的括号匹配的C++程序，用来检验输入的各种括号是否配对正确。-Data structure of the C++ brace matching procedures used to test whether the input of the various brackets match correctly.
Artificial-shuffle
- 模拟人工洗牌使用结构card 来描述一张牌，用随机函数来模拟人工洗牌的过程，最后将洗好的52张牌顺序分别发给四个人。 对每个人的牌要按桥牌的规则输出。即一个人的牌要先按牌的花色（顺序为梅花、方块、红心和黑桃）进行分类，同一类的牌要再按A、K、Q、J、…、3、2牌的大小顺序排列。另发牌应按四个人的顺序依次分发。 -Artificial shuffle
telephone
- 数据结构课程设计，电话簿，单链表。重点在于链表的使用。-Data structure curriculum design, telephone directory, a single linked list. Focuses on the use of linked lists.
recover-the-binary-tree
- 利用先序，中序遍历恢复二叉树 ，用兴趣的朋友可以看一下-Advantage of the preorder traversal restore binary tree, and interested friends can look at
aly
- 写出将一个无向图的邻接矩阵转换成邻接表的算法-Write an undirected graph adjacency matrix algorithm converts adjacency list
dongtaiGH
- 该算法主要是为了在图中找到强连通分支，请看源码注释。-The algorithm is mainly for the map to find strongly connected branch, see the source notes.
Document
- 进行文本输入及输出，统计个数，并且查找输入串的次数-For text input and output, statistical number, and find the number of input strings
xiererfenchazhao
- 希尔排序c++数据结构算法 二分查找的递归算法-希尔排序c++数据结构算法 二分查找的递归算法
024
- 二叉树算法的应用。用C语言简单实现的一种小算法-Binary tree algorithm is applied. Simple implementation in C language, a small algorithm
bintree
- 构造二叉树，对二叉树进行先序，中序，后序等三个遍历，自己先构造一颗二叉树，然后再进行输入。-Construct a binary tree, binary tree traversal of the first sequence, order, order three, first construct a binary tree, and then enter.
CPPLinkList_Intersection_Union
- C++实现建立链表，且通过链表数据求并集，交集-The C++ achieve the establishment of a linked list, and through the linked list data seek union, intersection
Bresenham_1937491052005
- This code implements Bresenham algorithm for drawing cricle.This technique can be appied to draw anything (not only circle). I use mingw32 and openGL library.