资源列表
caozuoxitong
- 有两个程序，进程调度和银行家算法，很是实用的，-There are two procedures, the process of scheduling and banker s algorithm, it is practical,
shujujiegou
- 关于符号排序的一个程序，是数据结构中比较好的一个实例-On the symbols of a sort process, the data structure is an example of relatively good
erchashu
- 实现二叉树三种周游，即先根周游，后根周游同对称周游。可选择-Binary tree to achieve the three travel, that is, around the first root, root around the same symmetry around. Optional
Jose
- 约瑟夫问题。能够实现最基本的约瑟夫问题操作-Joseph problems. To achieve the most basic problem operate Joseph
haffman
- 哈夫曼算法。能够实现最基本的哈夫曼算法内容。-Huffman algorithm. To achieve the most basic content Huffman algorithm.
fzwlktlj
- 复杂网络中最短K条路径问题的求解算法研究.pdf 求解路径问题的另一新颖的算法-Complex network of K shortest path algorithm to solve the problem. Pdf Routing Problem Solving another novel algorithm
Huffman
- Huffman c环境下的实现 数据结构课程设计题目-Huffman c environment data structure to achieve the curriculum design topics
2222
- 银行家算法的课程设计。自己做的 请大家看看。。是否能用-Banker s Algorithm curriculum design. Themselves do I want you to look. . Whether it can
daan
- 严蔚敏数据结构题集C语言版）习题集》答案.rar-YAN Wei-Min title data structure set C language version) Exercise collection answer. Rar
HFMBM
- 问题描述： 设计哈希表实现电话号码查询系统。 基本要求： 1、设每个记录有下列数据项：电话号码、用户名、地址； 2、从键盘输入各记录，分别以电话号码和用户名为关键字建立哈希表； 3、采用再哈希法解决冲突； 4、查找并显示给定电话号码的记录； 5、查找并显示给定用户名的记录。 6、在哈希函数确定的前提下，尝试各种不同类型处理冲突的方法（至少两种），考察平均查找长度的变化。 -Problem Descr iption: Design hash table to ach
divide
- 学算法时写的程序了，这里时分治的算法，包括归并排序和快速排序。供大家参考-Learning algorithm when the written procedure, the algorithm rule around here, including the merge sort and quick sort. For your reference
greedy
- 贪心法的算法，里面有最小生成树算法和单点源最短路径的算法，供大家学习参考-Greedy algorithms, there are minimum spanning tree algorithm and single-point-source shortest path algorithm, for them to learn from reference