资源列表
changge
- 批量转换数据，能不十六进制批量转化为十进制
46565
- linux 下开发的哈夫曼编码掩饰程序，可以直接运行，无需调试-Huffman developed under linux cover procedures can be run directly without debugging
BiTree
- 二叉树的前序、中序和后序的递归和非递归算法的遍历。-Binary tree traversal
DuinStack
- C++共享栈，很浅显易懂的代码，适合初学者，-C++ shared stack, it is easy to understand the code, suitable for beginners, ha ha ~ ~
Data-structure
- 殷人昆的数据结构的前三章课件，PPT格式。如果有需要可以联系我上传4章以后的-PPTs of Data structure written by Yin Renkun of Tsinghua University
Bankers-algorithm
- 计算机操作系统实验。用c++编写的银行家算法程序，内附运行截图。运行时将源程序直接复制粘贴到编译器，保存为.cpp文件即可。-Computer operating system experiment. Written by c++ bankers algorithm, enclosing run shot. Runtime copy and paste the source code to the compiler directly, save it as a. Cpp file.
The-optimal-route-inquires-bus
- C开发，利用Floyd算法找出按时间的所有两站之间的最优路径，按时间最优的路线选择，按价格最优的路线选择-C,Floyd，Find out optimal path，by time, by price
TREE
- 树型结构是以分支关系定义的层次结构，它是一种重要的非线性结构。树型结构在客观世界中广泛存在。而平衡二叉树因其特性，它在查找时拥有比普通二叉树更高的效率，所以它拥有很广泛的应用。 关键词：二叉树，平衡二叉树，查找 -Tree branch relations are defined hierarchy, it is an important non-linear structure. Tree is widespread in the objective world. The balanc
suanfafenxiyusheji1
- 山东师范大学信计算机算法分析与设计课件1
hannuota
- 用链表实现了汉诺塔的问题,主要用了链表的创建，插入，排序，删除，等-use the link to solve the hannuota problems
Triangulation2d
- 另一种快速三角划分算法，也是很快，但是没有优化。-very fast method，but not the best！！！！
splaytree
- 从自顶向下和自下向上两种方法实现了伸展树的全部功能 如插入 查找 删除 合并 分裂-Tree stretching from the top-down and bottom-up are two ways to achieve all of the features, such as the insertion Find deleted merger split