AssignWeek6HuiJin

矩阵连乘算法，实现几个矩阵相乘的最优顺序，并计算出复杂度-matrix continually multiply algorithm, achieving several matrix multiplication, the optimal sequence and calculated complexity

小图书馆管理系统，有检索、查看，借书，超期表，还书，赔书等功能，还有按专业统计等，access小程序-small library management system, search, check the library and extended table, book, indemnities, and other functions, there are also professional statistics, the access of small procedures

彪彪关游戏 a) 如何使用? 第一次单击任何记得，然后按钮后单击一个按钮，然后记住所有的任何按钮，您单击了。 增加了匹配按钮时发现那两个这些按钮中删除的时间和柜台。 当你无法识别匹

建立试题库文件，随机产生n个题目； 题目涉及加减乘除，带括弧的混合运算； 利用栈求解表达式的值； 随时可以退出； 保留历史分数，能回顾历史，给出与历史分数比较后的评价( The establishment of test database file, the subject of n randomly generated topics related to addition, subtraction, mixed operations with parentheses use the value of the expression stack solution ready to quit to preserve the historical scores, can look back at history, and history gives the comparison of scores Evaluation 保留历史分数，能回顾历史，给出与历史分数比较后的评价)

这是一个生成全排列的程序,采用最小变化算法,相邻两个序列之间只有两个数的次序不同,每交换两个数,便形成一个新的序列,速度非常快.-This is a whole generation with a procedure using the smallest change algorithm sequence between two adjacent only two of several different order every two exchanged a few, it will lead to a new series, very fast.

药品进销管理程序,内有SQL附加的数据库.....详情看里面的,运行就OK -Drugs into the sales management process, with additional SQL database ..... read more inside, running on the OK

数据库模式读取delphi源程序，可以读取多种关系数据库-Delphi source code to read the database model, which can be read by a variety of relational database

自己开发的b+树代码,经过本人测试,已经初步通过,有问题请联系我-b own development code tree, after I test, it already passed, please contact the problems I

穷举密码算法 /在许多情况下我们需要穷举组合的算法，比如密码词典。 //这个算法的关键是密码下标进位的问题。 //另外本例子中的写文件语句效率比较低，为了降低算法复杂度没有优化。 //如果要提高写文件的效率，可以使用缓冲区，分批写入。-Exhaustive Cipher/In many cases we need to exhaustive combinations of algorithms, such as the password dictionary.// This algorithm, the key is password subscript binary problems.// Another example of this statement to write a document relatively low efficiency, in order to reduce the algorithm complexity is not optimized.// If you want to improve the efficiency of writing documents, you can use the buffer, write in batches.

在知道点的坐标或者数量和权重值时，选择最优的路径，这种有的是基于时间有的是基于运费等等，自动找两点路径最短距离！-Know the coordinates of points in the volume and weight or value, the choice of the optimal path, this time based on some because of some freight, etc., automatically find the shortest distance between two points in the path!