This is a use of the Java language in a series of small procedures, the java jav...

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.

结构数据的读写是指从"流"文件中读取数据存入结构，或将结构数据写入"流"文件。我们可以用以下两种方法进行结构数据的文件读写-read and write data structure is defined as "the flow" paper read data are stored in the structure or structures to write data "flow" document. We can use the following two methods for the structure of documents to read and write data

VB+proteus+keil c 文件是电压检测系统 -VB+ proteus+ keil c are voltage detection system

数据结构中各种排序算法的实现 还是排序性能的比较 -Data structure in a variety of sorting algorithms or to sort of realize the performance comparison

我自己写的一个解决约瑟夫环的小程序，对学习数据结构的朋友可能有一些帮助,tc2编译通过-I wrote it myself a solution Josephus small procedures, the data structure of the study may have some friends help compile indexes

vb编的医院管理系统，需要的可以下载，有兴趣自行习惯-vb series of the hospital management system, the need to be downloaded, are interested in their own habits! !

我们的一个数据结构的课程设计,计算一元稀疏距阵的计算器,即是一元多项式的相加相减相乘求导求X值...还有利用彩色文本形式编写的一个界面.非常的好看,使用也方便-the data structure of a curriculum design, calculation of one yuan sparse matrix of calculators, serves yuan polynomials together subtract multiply derivative for the value of X ... There color text prepared by the an interface. very pretty, ease of use

一元多项式乘法　包含密运算　 新学数据结构的可以参考参考　-One dollar secret polynomial multiplication operations include the new data structure can refer to reference

迷宫问题 数据结构-maze data structure problem

网络优化算法：任两点间最短路径问题的BellmanFord算法-Network optimization algorithms: the shortest path between any two points BellmanFord algorithm issues