中南的数据结构试验1

最近点对问题的图形界面实现，用户可以通过鼠标输入点集，也可以通过随机生成点集，程序会将最近的两个点用红色标示出来-Nearest point on the question of the realization of a graphical interface, users can mouse input point set, can also be randomly generated point set, the program will be the two most recent points, marked in red

汇编语言好的程序，大家来看看 图书选购,(可按分类方式查找图书，或通过关键字进行查询) 购物车功能. 查看图书详细情况。用户注册. 用户登录. 查看用户的订单信息. 修改用户个人信息。后台管理部份：商店图书管理：添加，修改，删除，查看。用户信息管理：查看，修改，删除。订单信息管理：查看订单清单，更新订单付款，出货状态。删除订单。 -good assembly language procedures, to look at the books you buy, (classification according to find books, or through keyword inquiries) Cart function. View details of the books. Registered users. User login. View customer orders information. Revised personal information. Some management background : stores library management : add, modify, delete, check. Users Information Management : View, modify, delete. Orders for information management : View a list of orders, updating of payment orders, shipping status. Delete orders.

伙伴系统:avail[0..m]为可利用空间表, n为申请分配量, 若有不小于n的空闲块, 则分配相应的存储块, 并返回其首地址,否则返回NULL -Partner system: avail [0 .. m] can be used for table space, n for the distribution of the volume of applications, if n is not less than the free block, then the distribution of the corresponding storage block, and return to its first address, otherwise return NULL

该程序用格雷码来生成组合数序列,它比一般的方法要快,这是由格雷码的分布特性所决定的.-the procedures used to generate Gray code sequence portfolio, it generally means than to be fast, it was a Gray code distribution by the decision.

Linux下的操作oracle数据库的连接库-Linux operating oracle database library

数据结构：轮渡管理-data structure : the ferry management

税率倒算，把原来计算好数额倒算回来。帐号有两种，一种是只查看的，一种是只计算的。-倒算rate, a good amount of the original calculation倒算back. Account there are two types of view only, and one is the only calculation.

分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.

这是一个生成全排列的程序,采用最小变化算法,相邻两个序列之间只有两个数的次序不同,每交换两个数,便形成一个新的序列,速度非常快.-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.

用数据结构做的约瑟夫问题，其中还包括类似问题中的猴子选大王算法 -do with the data structure Joseph problems, which also included a similar problem is the monkey king algorithm election