资源列表
RecommendedExercise1
- SSD5 Recommended Exercise 1 -SSD5 Recommended Exercise 1
strcmp
- 这是我制的，调试过，小意思别见笑可以将输入的两字符串进行比较相等返回0，不等时返回两字符串的差值-This is my system, and the debugging that other small token of kindly feelings can be a laughing stock of the two input strings equal to 0 comparison, the returns ranging from two strings of the margin
123
- 实现一定的功能，进行加减运算，可以任意输入各种数据，实现其功能。-The realization of certain functions, to carry out addition and subtraction calculations, can enter all kinds of data, the realization of its functions.
sort
- 该算法是通常的选择排序、堆排序、快速排序、shell排序的集合-quick sorting、shell sorting、heap sorting and so on
trie_test.rar
- 自己实现的一个字典数算法，实现对单词的查找，不区分大小写,Own implementation of a dictionary algorithm to find the word, not case-sensitive
Kruskal_gao
- Kruskal算法寻找最小生成树,C语言实现，有完整的注释！-Kruskal finding minimum spanning tree algorithm, C Language, a complete Notes!
HUFFMAN_code_for_algorithm_design
- this is huffman code for algorithm design
Cpp2
- 要求利用插入运算建立线性链表，完成链表的查找、删除等运算-To insert the operator to establish the linear list, complete the linked list to find, delete operations
skepTable
- skipList，跳表。使用c++实现，无测试用例，可直接加到项目中使用-skipList，can be directly put into projects.
exp7-1
- 实现二叉树b的各种运算： 1. 输出二叉树； 2. 输出 H 结点的左·右孩子结点值； 3. 输出二叉树b的深度； 4. 输出二叉树b的宽度； 5. 输出二叉树b的结点个数； 6. 输出二叉树b的叶子结点个数。-Binary Tree b to achieve a variety of computing: 1. Output tree 2. Output the children of node H child nodes around node val
Monks_and_Savage
- 数据结构中一个简单的修道士与野人程序，统计出了所有过河的情况-Data structure with a simple monk Savage procedures
1
- 利用VC++6.0实现了基于伙伴算法的内存分配与释放，算法中只使用了数组这一数据结构，算是一大不足，希望大家予以完善-Achieved using VC++6.0 based partner with the release of memory allocation algorithms, the algorithm uses only the array data structure can be regarded as a big enough hope to improve