this program is very good

可重用的，PYQT编写的oracle数据库登录通用窗口（通过录入数据库IP地址、端口，用户名、密码等），

Dapper-一个简单的.Net对象映射程序

本程序实现各种排序算法并分析与比较 直接插入排序， SHELL排序，冒泡排序，快速排序，简单选择排序，堆排序，归并排序-procedures for the realization of the algorithm and analysis more directly inserted, in order of ranking SHELL, Bubble Sort, rapid sequencing, simple choice, in order of ranking sculpture, merging Sorting

编写一程序，统计学生的成绩信息（保存在文件Score.dat中）。 要求： 1. 能按总分，数学成绩，英语成绩，计算机成绩分别排序 2. 能分别统计数学，英语，计算机中不及格人数 3. 能按学号查找学生，并显示该学生信息。 注 1. 从文件中读入数据以及功能菜单显示已在文件ReadData.c 和Menu.c中给出； 2. 代码的总体结构已在文件Score.c中给出，并定义了一些函数头，但有关函数体代码和一些主程序处理代码要求学生填写，也可以修改函数头； 编译score.c即可 -prepared a procedure, the results of the students statistical information (stored in the document Score.dat). Requirements : 1. According to score, the math and English results, the computer results were 2 ranking. Statistics were able to mathematics, English, Computer failure number three. can search by school, students, and that the student information. Note 1. Read from the file into the data and functions of the menu showed the documentary and Menu.c ReadData.c given; 2. The overall code structure has been the Score.c given, and the definition of some of the first function, However, the body function code and address some main program code requiring students to complete, can also modify function first; compiler can s

看见有些拿螺旋数字矩阵做考题的，虽然本来也不难，可是你要一着急也许就想不出来了呢:)-see some figures with spiral matrix so many questions, although otherwise it is not difficult, but you may be an anxious not want to come out? :)

选课管理数据库,以SQL为实际的数据平台，灵活建立数据库、数据库表、实现对表的各种查询等。-Course management database to SQL data for the actual platform, the establishment of a flexible database table to table to achieve the various inquiries.

应用背景可实现交通路线的最优路线；修建主干道路的设计路线；修建网络主干的最优路线等等都可以通过最短路径算法实现关键技术从某个源点到其余各顶点的最短路径，其中有按长度递增的迪杰斯塔拉算法，带权的迪杰特斯拉算法能有效的实现最短路线的设计

Axion 是一个小型的，快速的SQL和JDBC 适应的关系数据库引擎，由JAVA编程语言编写并且用于JAVA语言。-Axion is small, fast SQL and JDBC adapt the relational database engine, and uses in the JAVA language by the JAVA programming language compilation.

压缩包内解决用计算机实现图论中的最短路问题-Compression package to resolve the computer graph theory realize the shortest path problem

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