资源列表
n_queens
- 在n×n的棋盘上放置n个皇后，现要求出使n元棋盘上的n个皇后互不攻击的布局。 -In n × n chessboard of n-place Queen
josephus
- 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 -Known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people r
bingchaji_kruskal
- 基于并查集的求最小生成树的Kruskal算法的实现-And set-based search for the Kruskal minimum spanning tree algorithm
Link_List_1317069162002
- 链表的实现，C++语言编写的。呵呵 链表的实现，C++语言编写的。-List of realize, C++ Languages. Ha ha realize the list, C++ Languages.
588909Java_UML_library
- 数据结构及算法 对于参加ACM的学生有一定帮助 里面有详细的解答-Data structure and algorithm for ACM students to participate in some help there are detailed answers
bignumbermultiplay
- 大整数乘法算法，可实现普通程序无法实现的大整数的相乘。算法简单，可作为数据结构与算法研究之用-Large integer multiplication algorithm, can be achieved can not be achieved with the ordinary procedure of the multiplication of large integers. Algorithm is simple and can be used as data structure and
c
- 数据结构的电子教案，对各章的重点说的比较清楚-Data structure of electronic lesson plans, the focus of the chapter, said the relatively clear
HuffmanCode
- 对文本信息进行哈夫曼加密，并将哈夫曼树及密码保存，然后进行解密。-Huffman text information encryption, and password and Huffman tree preservation, and then decrypt.
HuffmanTree
- 根据一段给定的文章构造哈夫曼树并对一段给出的代码译码成为一段文章，输入输出均通过文件来实现，并配有报告文档。-According to the article section of a given structure of the Huffman tree is given a section of the code decoding to become a section of articles, input and output are achieved through the docume
sort
- 用四种方法实现对随机的10000个数的排序，并比较这四种方法性能的差异。-Four methods used to achieve the number 10000 on the random sequencing and comparing the differences in the performance of four methods.
yyscreatfptree
- 创建FP-Tree树的过程。从.txt文件中读取字符型数据，然后创建FP-Tree。-The creation of FP-Tree tree process. From. Txt file to read character data, and then create a FP-Tree.
ISAM_BTRE
- ISAM系统实现，含有BTREE源码，等-ISAM system containing BTREE source, such as