计算机模拟考试3级网络技术笔试

越来越多的书会导致非托管库。这里是一个简单的桌面项目，可以帮助任何研究所管理其图书馆。

直接插入排序 排序过程：整个排序过程为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

用C++Builder写的数据结构队列问题的程序。希望对大家有用。-C Builder write queue data structure of the proceedings. We hope that the right useful.

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2

数据结构演示系统，有助于进一步了解和验证数据结构中的算法-data structure presentation systems and contribute to further understanding and validation of data structure algorithms

通过在远端主机上搭建一个远程字典服务服务器，其它主机可以通过客户端程序 RemoteLookup将所需要查询的单词传送给远程主机，远程主机字典服务服务器将单词的中文释义结果返回给客户端主机 -Through the structures on the remote host a remote dictionary service server, other hosts can RemoteLookup client program will need to send word query the remote host, remote hosting service server dictionary word to return to the Chinese interpretation of the results to the client host

设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0

prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的，已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.

这是我们实习时编的，实现了基本的功能，如插入，删除，查找等。初学 C++的同志们可以参考：）-This is our attachments series to achieve the basic functions, such as inserting, deleting, and searching. Novice C comrades can reference :)

oracle问题集，适合初学者-problem sets, suitable for beginners