连接到Oracle数据库从Fortran代码

实现查找一组给定点中的最近点对，通过分治方法将问题求解，简化问题的复杂性。-Lookup a group to the latest sentinel points right, adoption of the partition method of problem solving, simplifying the complexity of the problem.

该系统为订单系统，用于管理订单信息-orders for the system, information for the management of orders

一个通讯录――――――利用C++实现的，非常不错哦-Address Book- C++ implementation

数据结构中的各种各样的排序算法-data structure of a variety of Sorting Algorithm

改良的新型遗传算法，增加了父代与子代的杂交，适合特殊问题求解。-New improved genetic algorithm, an increase of parent and offspring of the hybrids, suitable for specific problem-solving.

说明: 这一段在复习数据结构和算法，有一些零星笔记，在Others这个归类下，欢迎指正。 对于排序算法，想做一个动态演示的东东，因此今天使用VB.net大概实现了一个，界面如下，代码有2个版本，一个可以指示当前循环的位置（但设计感觉不好，也找不到更好的办法），一个没有。 -Note : This section of the review of data structure and algorithm, a few scattered notes, in the classified Others, welcomed the correction. For Sorting Algorithm and do a demonstration of the dynamic page, and it is probably using VB.net achieved one of the following interface, the code has two versions, one can instruct the current cycle position (but feel bad design, but also find better ways), a no.

一个三层应用程序，演示如何通过ADO对象以及存储在SQL Server中的Procedure实现高性能的数据访问(在运行程序前首先要设置SQL Server，在压缩包中有一个Procs.sql的文件，首先在SQL Server上运行该文件设置SQL Server数据库)-a three-tier applications, demonstrating how ADO and SQL Server stored in the Procedure to achieve high-performance data access (in the first before running the program to set up SQL Server, in a compressed Procs.sql a document, the first in SQL Server running on the document set up SQL Server database)

女问题描述： 设R={r1,r2,...rn}要进行排列的n个元素。其巾元素r1,r2...rn可能相同。试设计 一个算法,列出R的所有不同排列。 编程任务： 给定n以及待排列的n个元素。计算出这n个元索的所有不同排列。-Female Problem Description: Let R = (r1, r2, ... rn) must be arranged in n elements. The towel elements r1, r2 ... rn may be the same. Try to design an algorithm listing all the different arrangement of R. Programming tasks: Given n and n elements to be arranged. To calculate the n-element array of all the different cable.

一个C++写的KdTree容器模板库，支持std容器，和自定义的存储方式，对插入、删除和查找作了优化-A C++ Written KdTree Template Library containers, support std containers, and custom storage by means of an insert, delete, and search was made to optimize

图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read