约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。...

此文件包含组成 calc24point 应用程序的每个文件的内容摘要。-calc24point application components of each document summary of the contents.

（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的20个所给出的ai和bi，第２行存放相应的作业序号，第３行存放１或２(１代表是来自ai，２代表是来自bi), 第4行存放0或１（０代表作业序号未进入最优调度方案；１代表作业序号已进入最优调度方案） （２） 排序完后，按课本所述方法求一种最优调度方案，存放在S中。 -(1) with a 4* 20 two-dimensional array M, the first a line to deposit a small to large order of 20 given by ai and bi, line 2 store operation corresponding serial number, the first three lines deposited one or 2 (a representative from the ai, 2 representatives from the bi), the first four rows stored 0 or 1 (0 for job number to gain access to optimal scheduling programs a job number has been entered on behalf of the optimal scheduling scheme) ( 2) Sort exhausted, according to the methods described in textbooks, seeking the optimal scheduling of a program stored in the S in.

编的很垃圾 大家多多包涵 主要功能矩阵相加 减 乘 除 大家多多指点-series of the very people refuse excused main function matrix arithmetic is a lot we kind

很好的教程实例，教务管理系统，Access数据库实现~-Very good tutorial examples of educational management system, Access database, to achieve ~

算法，钱币组合。可设定钱币种类数量，找出组合种数。-Algorithm, coin combinations. Can set the number of coin types, identify the combination of species.

一个小型的旅行社管理系统-a small travel agency management system

解N元一次方程，从文件读入整数 N, 然后读入N*（ N+1）矩阵，得到解并输出到文件中。-Solution of N-linear equation, reading from a file into an integer N, and then read into the N* (N+1) matrix obtained solution and the output to a file.

队列,1、 掌握队列的顺序存储结构和“假溢出”的处理方法 2、 设计用标志位解决“假溢出”问题的顺序队列 -cohort, 1, the master queue storage structure and sequence "false spillover" of the two treatment methods. Design signs spaces, "false spillover" in the order queue

自动抄表计费系统、 基于 GSM。其我的项目。bt 不幸的是我可以没有准备好到AT89S52 微控制器方案......，所以请能 at89s52 microcontrollr 编程数据......plz 帮我

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-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.