simple database management system

list方法,包含创建list和创建节点-function of list

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

its about the bubble sorting.

前一阵出去玩了，补回还差的2个，里面包括上次上载的一共5个，另加个汇编程序，是课堂实验-play out a little while ago, to compensate for the worse two, including the inside on the last of a total of five, plus a 000 assembler, a classroom experiment

derby database source code.good for you.

本次上机考试包括4题，求P点，求日期，求最大值与最小值，和求最小距离。 难度以最P点与求最小距离较难。题目在文件中已包含，写有详细的注释。

三级网络技术上机题答案-three-network technology that answers

直接插入排序 排序过程：整个排序过程为n-1趟插入，即先将序列中第1个记录看成是一个有序子序列，然后从第2个记录开始，逐个进行插入，直至整个序列有序-Direct Insertion Sort to sort the process: the whole process of sorting times for the n-1 insert, that is, first sequence of the first one recorded as an orderly sequence, and then from the first two records began to insert one by one until the entire sequence has Preface

2-3树的数据结构以及演示程序-2-3 tree data structure and Demonstration Program

清华1992年版的数据结构的答案-Tsinghua University in 1992 version of the data structure of the answer