Tutorial on data access using store procedure for MSSQL

很好的一个源程序-a good source

数据结构中排序的实例分析，可供有兴趣的朋友参考学习-Sort of data structure example of analysis, available to interested friends refer to learning

在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。 给定作业序列，要求一种作业排序算法，使获得的总效益值最大。 -On a single machine can handle only n-jobs, each job can be completed within the unit, but also assumes that each job has a deadline, if and only if job i in its completed before the deadline, they can to receive some benefits. For a given job sequence, requires a job sorting algorithm, so that the greatest value of total benefits received.

oracle进行时间运行程序-time for operational procedures

本程序演示了如何使用编辑器在运行期设置表格的一些常用参数 需要使用到Ehlib控件,最好使用3.6版本,旧版本也适用! 使用前请双击本目录下的DB.UDL连接数据库,连接完成后即可选择数据表进行演示! 在表格上按右键,即可出现功能菜单,点击进入! 程序应该适用于各版本的DELPHI,但由于条件有限未做测试!-This procedure demonstrates how to use the editor in the run-time set up tables need to use some common parameters to Ehlib control, it is best to use 3.6 version, also applies to older versions! Before use double-click the catalog under DB.UDL connect to database, connectivity be able to choose after the completion of data table demo! Right-click in the table can function menu appears, click to enter! procedure should be applicable to all versions of DELPHI, but due to limited testing done!

算法设计与分析实验报告，内容很全面的，呵呵。-algorithm design and analysis of experiments report, very comprehensive, huh.

数据库操作功能类，包括添加，修改，删除等操作。直接调用就可以。-Database operations functional categories, including add, modify, delete, etc. operations. Can be called directly.

数据结构里面实现图：拓扑排序、最小生成树、关键路径、深搜、广搜、优先路径

一个效率很高的通配符查找算法，适用于对"*"和“?”的通配符查找，可以根据需要进行修改，适用于不同应用， 另外还有一个非常适用的CRC检查算法-a highly efficient wildcard search algorithm that applies to the "*" and "the" wildcard search, it may need to make changes apply to different applications, there is another very applicable CRC check algorithm

基于VISAUL C++开发的 关键路径求解 属于数据结构-Based on VISAUL C++ Developed to solve the critical path data structure belonging to