资源列表
归并排序
- 归并排序,简单排序，二分的一些拓展，数据结构，基于C++平台实现，过程可以自己尝试调试(Merge sort, simple sorting, two points expansion, data structure, implementation based on C++ platform, process can debug by itself.)
算法课设
- 排序算法例程比较 Comparison of scheduling algorithms(Comparison of scheduling algorithms)
Heap sorting
- 本程序可实现堆排序重构，用完全三叉树来实现堆排序中的堆(This program can achieve heap sort refactoring, and use full tri tree to achieve heap sort.)
sparse matrix_hash
- 设有n*n 的稀疏矩阵，其稀疏因子为γ = 0.5%，装填因子为α = 0.5，用哈希表作为存储结构。以哈希表作为存储结构，实现稀疏矩阵元素的存取并计算平均查找长度。(The sparse matrix with n*n is sparse factor of gamma = 0.5%, the loading factor is alpha = 0.5, and hash table is used as storage structure. Hash table is used as sto
BinarySortTree
- 构造二叉排序树，输出元素值位于指定范围（ low，high）内的所有元素值。(The binary sort tree is constructed, and the output element values are all elements in the specified range (low, high).)
JobSequence
- 最佳工作序列算法：有N件工作，输入每件工作的费时、最后完成的期限及工作的价值，试求可能的一个完成工作序列，使价值和最大。(Best work sequence algorithm: N work, input each work time consuming, the final completion time and the value of the work, try to find a possible completion of the work sequence, to make th
linjiejuzhen
- 对新加入节点之后的网络的邻接矩阵进行修改并保存。(The adjacency matrix of the new join node is modified and saved.)
约瑟夫环
- 约瑟夫问题是一个经典的问题。已知n个人（不妨分别以编号1，2，3，...，n 代表）围坐在一张圆桌周围，从编号为 k 的人开始，从1开始顺时针报数1, 2, 3, ...，顺时针数到m 的那个人，出列并输出。然后从出列的下一个人开始，从1开始继续顺时针报数，数到m的那个人，出列并输出，...依此重复下去，直到圆桌周围的人全部出列。 输入：n,k,m 输出：按照出列的顺序依次输出出列人的编号，编号中间相隔一个空格,每10个编号为一行。 非法输入的对应输出如下
link_list
- 使用C语言，构成单链表，实现单链表的增删改查功能(C language is used to form single linked list, and add and delete functions of single linked list.)
dblink_list
- 使用C语言，构成双向链表，实现双向链表的增删改查功能(C language is used to form a two-way linked list, so as to realize the function of adding and deletions and changing functions of two-way linked list.)
sequeue
- 使用C语言，构成队列，实现队列的入队以及出队操作(The use of C language, a queue, queue enqueue and dequeue operations)
linkstack
- 使用C语言，构成链表栈，实现链表栈的增删改查功能(C language is used to form linked list stack, so that we can add and delete functions of linked list stack.)