应用程序,面向课程设计

用VB开发的一个学生管理系统，有基本的添加、修改、查询、删除的功能，还可以把这个系统安装-Using VB to develop a student management system, has the basic add, modify, query, delete function, the system can also be used to install

SQL Server、Oracle、Sybase、ODBC的JDBC驱动文件，全部测试过-SQL Server, Oracle, Sybase, and ODBC JDBC driver, all tested

主要是用在学校里记录学生考试成绩，方便学生和老师在网上对成绩进行查询

n个数的全排列的非递归算法，cpp文件可编译运行-n the number of full-order non-recursive algorithm, cpp files can be compiled to run

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.

01背包问题最简单实现，可在其上做更多的扩展，不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack

数据结构，用栈实现表达式求职，是改进后的算法-Data structure, with the stack to achieve expression for employment, is the improved algorithm

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

（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的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.