资源列表
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.
Temp1
- 使用C语言实现一种对海量数据的处理，从文本读入并输出到文本-Using C language to implement a massive data processing, read from the text and output to a text
Test
- 有序顺序表的二分查找的递归算法。 对输入数据构造二叉查找树 ，建立二叉查找链表结构，并能实现查找、插入、删除等操作 -Binary recursive algorithm to find an orderly sequence table. Find the input binary tree data structure, build a binary search list structure, and can achieve search, insert, and delete o
Test6
- 最短路径算法。 用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。 输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。 输出：源点到其它各点的最短路径值。-Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from
ercha
- 这个是数据结构中比较重要的二叉树算法，在平时的写作中也是比较常用的-This data structure is more important binary tree algorithm, in the usual writing is relatively common
Floyd-algorithm---h
- 图也是数据结构中主要的一块，锁业它的重要性就不用说了，在这个算法汇总可以看到有向图和无向图-Data structure diagram is also a major piece of its importance, lock industry, needless to say, this algorithm is summarized in the graph and you can see that there are undirected graph
Horseridingboard
- 利用Java语言实现马踏棋盘问题，图形化界面，附带背景图片。-Using Java language horse riding chessboard, graphical interface, with a background image.