资源列表
PrjEGov42
- 非常好用的排课系统源码 可以参考一下 然后试着-Timetable system very easy to use source code can refer to and then try to learn
2
- 找出给定序列的所有逆序对，并输出。 逆序对：若i < j ==> A[i] > A[j] 则(i,j)为一个逆序对-Identify all the given sequence in reverse order right, and output. On the reverse: if i < j ==> A [i]> A [j] then (i, j) as a reverse pair
3
- 利用random(0,1)实现random(a,b) 原型: void srand(unsigned seed) 功能: 产生随机数的起始发生数据，和rand函数配合使用-Starting with the use of a random number generated occurrence data, and the rand function: the use of random (0,1) to achieve random (a, b) prototype: void sra
4
- 给定k个链表，利用最小堆实现有序链表的k路合并，并输出结果。-Given k a list using the minimum heap achieve an orderly list of k-way merge, and outputs the result.
7
- 实现：平均排序 (k排序) k排序的定义：A[i] <= A[i + k] 即为希尔排序的不完全实现-Implementation: Average sort (k sorting) k sort defined: A [i] < = A [i+ k] is not fully realized Hill sort
least-common-ancestor
- Tarjan的脱机最小公共祖先问题，里面使用了pair,map以及结构体等相关结构-Tarjan off-line least common ancestors problem
rbTree
- 红黑树的插入删除，旋转，前驱和后继等操作都有实现。-in this source file ,we have realized the insertion,deletion and rotation,predecess and successor operations
introduction-to-algorithm
- 算法导论第三版书里的部分代码（大约到第22章，22章之后的代码稍后会更新）。-introduce to algorithm,this compressed file includes all the source code before chapter 22 (including 22), which all are writen by myself.
0-1-backpack
- 本代码提供0-1背包问题的动态规划解法，适用于背包容量是整数类型-The code provides 0-1 knapsack problem dynamic programming solution for the backpack capacity is an integer type
dir-biao
- 这是一个C++设计的动态数组顺序表类，帮助别人学习C-This is a dynamic array class C++ order table designed to help others learn C++
Bank
- java实现银行家算法，程序具有简单易懂的说明，可供借鉴-java bankers algorithm, the program has easy to understand instructions for reference
Test1
- 编码实现对单链表的操作，实验程序，可供借鉴。-Coding for the operation of a single list, experimental procedures, for reference.