全国计算机等级考试三级的部分上级题算法，对上机考试还不是很熟的人，很有帮助（并非书上的答案，是本人自己想的算法）...

关于货箱装船问题的贪婪算法，只是简要描述-Container ship on the issue of greedy algorithm, only a brief description of

求单源点最短路径算法，对一个途中各个节点和权值的设置，找出从起始点倒终结点的一条最短路径，不能够输出路径

将excel格式的文件销售订单导入数据库中-Will excel file sales orders into the database

湖南大学ACM-OJ的部分题目代码，对学习数据结构和算法很有帮助-Hunan University ACM-OJ part of the subject code, the data structure and algorithm to learn helpful

（1）满足均匀分布的[M,N]区间随机数，其中M,N是正整数。 (2) 满足指数分布的[M,N]区间随机数，其中M,N是正整数。 -(1) satisfy the uniform distribution of [M, N] interval of random numbers, in which M, N be a positive integer. (2) to meet the exponential distribution of [M, N] interval of random numbers, in which M, N be a positive integer.

应用背景粗糙集应用R工作室编码。 ；粗糙集不可分辨，利用程序计算阳性面积等。关键技术本工作室是一个软件，在网络上是免费提供的。源代码可以在Studio容易实现

一个不错的员工培训系统-a good staff training system

将电子表格Excel中的数据保存到SQL数据库中-Excel spreadsheet data saved to the SQL database

这是一个简单的实用程序，允许您在不安装MS access的情况下压缩和修复access数据库。对于使用commondialogs和简单的文件复制/删除以及compact&；repair例程的示例来说，它也很好。

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time