资源列表
huffman
- 利用哈夫曼编码的原理对字符进行处理,最后输出的是对输入的字符的0和1的编码-The principle use of Huffman coding of characters to deal with the final output is the input of 0 and 1 character encoding
EX9-1
- 遍历二叉树并使用3种方法统计结点与叶子结点-Binary Tree Traversal and use three kinds of statistical methods and leaf node node
ds
- 数据结构的C语言实现，包括链表，堆栈，队列，哈希表，二叉树，其中哈希表经过实践可实现1秒查询100万次-Data structure of the C language, including the list, stack, queue, hash table, tree, hash table which can be achieved through practice one seconds query one million times
suanfa
- 数据结构三种先序遍历非递归算法。 数据结构三种先序遍历非递归算法。-Data structure of three first traversal non-recursive algorithm. Data structure of three first traversal non-recursive algorithm.
datastructure
- 数据结构的全部课程实验，车厢调度，一元稀疏，停车站，哈弗曼-Data structure of a full course of experiments, train scheduling, one dollar sparse, parking stations,哈弗曼
exe1-063340
- SSD5 中EX1的参考答案 下载后请参照注释认真分析-SSD5 in reference answer EX1 download Please refer to Notes careful analysis
yinhangjiasuanfa
- 利用银行家算法实现资源分配。当某个进程提出资源请求是，假定先分配给它，然后查找个进程的请求，检查系统剩余资源是否由于分配而导致思死锁。若是则该进程等待；否则，为其进程所需资源。-Bankers algorithm using the allocation of resources. When a request is put forward the process, it is assumed that first be allocated to it, and then find a proc
optional_exercise_3
- ssd5-数据结构-optional-exercise3练习题答案保证正确-ssd5-data structure-optional-exercise3 exercises to ensure that the correct answer
200603011052sjjg
- 本人自己作的一个数据结构课程设计,曾获得过满分.它是一个停车场管理系统,利用所学的栈,队列知识对停车厂管理系统进行模拟.本程序有记录停车时间的功能并且可以自动计费,功能强大.-I own a data structure for curriculum design, has won out. It is a car park management system, using what we learned in the stack, queue停车厂knowledge management sy
btree
- Trees are natural structures for representing certain kinds of hierarchical data. A (rooted) tree consists of a set of nodes (or vertices) and a set of arcs (or edges). -Trees are natural structures for representing certain kinds of hierarchical data
LSM_Match
- 阅读您的文件最小二乘匹配and高斯解方程子程序-Read your document matching and least-squares Gauss solution equation Subroutine
Optimalbinaryindexassignments
- Optimal Binary Index Assignments for a Class of Equiprobable Scalar and Vector Quantizers-Optimal Binary Index Assignments for a Class ofEquiprobable Scalar and Vector Quantizers