资源列表
Huffman
- 实现哈夫曼编码，通过建哈弗曼树实现代码，环境为VC-Huffman tree
bahuanghou
- 在8行8列的棋盘上放置8个皇后，使任一个皇后都不能吃掉其他的7个皇后（注：皇后可吃掉与她处于同行或同列或同一对角线上的其他棋子），并将结果以某种方式显示出来。-In line 8 8 8 placed on the board the Queen, so Queen can not eat any of the other seven Queen (Note: Queen can eat with her in the same column or the same peer or other
rbt-alg
- Red black tree implementation using array
DSHashcode
- create hash table .search-create hash table .search...
five-sorting-algorithm
- 五种排序算法的C语言版，分别有：快速排序，希尔排序，简单选择排序，直接插入排序，冒泡排序。-Five C-language version of sorting algorithms, respectively: quick sort, Hill sort, selection sort is simple, direct insertion sort, bubble sort.
KMP
- KMP算法的两种实现方法，在机器上实际运行测试过，希望能帮助有缘人！-KMP algorithm to achieve the two methods, the actual operation of the machine tested, the program is absolutely accurate and reliable!
N_huanghou_problem
- 基于C语言的N皇后问题的经典解法，在本人的机器上成功运行通过，下载后即可运行！-C language based on the classic N-Queens problem solution, in my successful run through the machine, you can download to run!
B_Tree
- 用C实现的一段B树源码。 是一个简单的示例，主要介绍如何实现B树的建立，插入、查询、删除等功能-Section B with the C implementation source code tree. Is a simple example, describes how to build a tree B, insert, query, delete, etc.
Gauss-projection-operator
- 大地测量学 高斯投影正反算 这是测绘遥感学生必须的程序-Positive and negative Gauss projection operator
Topological_order
- 这是一个基于图的拓扑排序的小程序，有深度优先和广度优先两种方法遍历-This is a graph-based topological sort of small programs, depth first and breadth-first traversal of two ways
CAVL-Tree
- 这是一个基于C++模板写AVL树，并实现了对应的遍历-This is a template-based C++ to write AVL tree, and to achieve the corresponding ergodic