资源列表
Activity_Arrange
- 活动安排问题：给出各项活动的起始时间与结束时间，列出一系列不冲突且最大利用空间的活动，算法采用的是贪心算法-Activity Arrangement Problem: Giving the start time and end time of each activity, list a series of activities which are not conflict and use the space maximally. The algorithm adopts greedy algor
aflow
- 用贪心算法解决aflow 有调整时间的流水作业调度问题。
tanxinfa
- 算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constra
List.rar
- 单向链表的标准c++实现范例 数据结构 面向对象 生成函数 复制函数 赋值函数 操作符重载,The standard one-way linked list c++ to achieve an example of object-oriented data structure constructor function Copy function overloaded assignment operator function
fourth
- 二叉排序树（Binary Sort Tree--BST）或者是一棵空树；或者是具有下列性质的二叉树： ⑴ 若左子树不空，则左子树上所有结点的值均小于根结点的值；若右子树不空，则右子树上所有结点的值均大于根结点的值。 ⑵ 左右子树也都是二叉排序树。 (3) 中序遍历BST可得到一个关键字的有序序列 文本文件单词索引是指将文本中单词按字母顺序列出并且列出每个单词在文本中出现的次数，它也是关键字列表的一种特例，即单词为关键字并附加每个关键字在文中出现次数.文本文
Huffmancode1
- 按照一定的规则构造哈弗曼树，使得输入的元素都作为叶子节点，然后从叶子到根逆向球每个字符的哈弗曼编码-According to certain rules of construction Havermann tree, making the input element as a leaf node, and then reverse the ball from the leaf to the root code for each character Havermann
list
- 给定两个升序链表，将它们逆序输出并合并成为一个新的升序链表-Given two ascending lists, reverse output and merge them into a new list in ascending order
binarysearch.c.ZIP
- this program gives manipulations on binary search trees
BinarySearchTree
- 用C++实现了二叉排序树的插入和删除操作，对于如何用链式结构实现树的各种操作是一个很好的学习源程序，经调试没有错误。-Achieved with C++ binary sort tree insertion and deletion operations, chain structure for how the various operations to achieve the tree is a good learning source, no errors after debugging.
Priority_Queue
- Priority Queue for C
guibinpaixu
- 归并排序和二叉线索树的c++源码，有详细注释-Clues to merge sort and binary tree of the c++ source code, there are detailed notes
avl-tree
- 用c语言实验AVL树，程序需要外加txt文件用来创建被遍历图，相信看了程序后很简单。-AVL tree using c language experiment, procedures used to create the necessary external txt file to be traverse map, I believe after reading procedure is simple.