资源列表
HashTable
- 实现Hash的基本功能，类实现一个哈希表，该哈希表将键映射到相应的值。任何非 null 对象都可以用作键或值。为了成功地在哈希表中存储和获取对象，用作键的对象必须实现 hashCode 方法和 equals 方法。 -Hash achieve the basic functions of class implements a hash table, hash table that maps keys to values. Any non-null object can be used as
BSTree
- 二叉排序树 插入 删除 前序 中序 后序遍历-Binary sort tree
mfc_ltree
- 基于MFC多叉树的程序代码，运行速度很快-MFC-based multi-tree code, run fast
suanfa
- 囊括经典算法三十个实例，对提示编程能力有很大帮助-Include classical algorithm thirty examples of the programming capabilities are very helpful tips
binary-tree
- 二叉树算法 分别用前序、中序、后序遍历二叉树。-Binary tree algorithms were used to pre-order, in order, the order of traversal binary tree.
changyongcyuyansuanfashouce
- c语言算法云集于此，在程序设计时可随时查阅，方便您的设计工作-algorithm c language gathered here, in the program design can be readily available to facilitate your design work
node
- 该资料包括链表的创建，显示，前中后的添加与删除，让你彻底的掌握链表的使用-The information includes list creation, display, before, during and after the add remove list lets you completely master the use of
jisuanjisuanfayunji
- c语言算法云集于此，在程序设计时可随时查阅，方便您的设计工作-algorithm c language gathered here, in the program design can be readily available to facilitate your design work
qsort
- 快速排序算法（分治策略） C++编写 调用递归-Fast sorting algorithms (divide and conquer strategy) C++ write
NO2
- 顺序表 create_sqlist(Sqlist *L)/*创建顺序表*/ { int k ElemType x k=0 scanf(" d",&x) while(x!=0) { L->data[k]=x k++ scanf(" d",&x) } L->length=k } void print_sqlist(Sqlist *L)/*输出顺序表*/ { int j
MyBiTree
- 完全二叉树的非递归前序遍历算法 一种比较好理解的方法-Complete binary tree pre-order traversal non-recursive algorithm is a relatively good understanding of the way
08-simple-sorting
- simple sorting algorithms