资源列表
Text6_2
- （1）分别采用递归和非递归算法建立二叉树； （2）采用先序、中序和后序三种方式遍历该二叉树； （3）按层次遍历该二叉树。 -(1) were used to establish the recursive and non-recursive algorithm for binary tree (2) using first-order, middle order and post-order traversal of the binary tree in three ways (
Address-Book
- 数据结构最经典的应用例子—通信录的实现。利用了链式结构的链表，适合开始接触数据结构的同学-Application data structure classic example- recorded communications implementation. Students take advantage of the chain structure of the list for getting started with data structures
HugeInt
- CHugeInt，处理任意位的超大整形数据的基本运算
TopologicalSort
- 通常，这样的线性序列称为满足拓扑次序(Topological Order)的序列，简称拓扑序列。简单的说，由某个集合上的一个偏序得到该集合上的一个全序，这个操作称之为拓扑排序。-Typically, such a linear sequence called meet topological order (Topological Order) sequence, referred to topological sequence. Simply put, by a partial order on
Exercise1
- SSD7. ex1. Part II Write SQL statements as specified below. You may find this help on setting up your DBMS useful. Submit your SQL statements in a file named createDB.sql. Write the DDL statements to create the two tables using the CREATE
Book-sales-system-(order-form)
- 图书销售系统(顺序表) 数据结构（C语言）wintc运行环境-Book sales (order form) data structure (C language) wintc operating environment
Bankers-algorithm
- 银行家算法 操作系统大作业C++语言源代码-Banker s algorithm
顺序表的基本操作
- 顺序表的基本操作，实现顺序表的插入，删除，输出
ShortestPath_DIJ
- 这是一个关于寻求最短路径的源代码！刚学不久，所以可能有错误！-This is a search for the shortest path to the source code! Just learning soon, it may be wrong!
0-1
- 分支限界法 0/1背包问题 程序 分支限界法 0/1背包问题 程序
LINKLIST
- This app is used to merge dll
P1005
- vijos p1005 超长数字串 枚举算法-vijos p1005 long string of figures enumeration algorithm