求最大公约数和最小公倍数的程序，输入两个数，能求出最大公约数和最小公倍数...

二叉排序树，实现简单的排序，删除，插入，保存，恢复等功能-Binary sort tree, the realization of a simple sort, delete, insert, save and restore functions

一、jsp连接Oracle8/8i/9i数据库（用thin模式） 二、jsp连接Sql Server7.0/2000数据库  三、jsp连接DB2数据库 四、jsp连接Informix数据库  五、jsp连接Sybase数据库 

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

java 数据库 功能强大 效率高 SmallSQL Database is a free DBMS library for the Java(tm) platform. It runs on the Java 2 Platform (JDK 1.4 or later) and implements the JDBC 3.0 API. SmallSQL Database is licensed under the terms of the GNU Lesser General Public Licence (LGPL). A copy of the licence is included in the distribution. Please note that SmallSQL Database is distributed WITHOUT ANY WARRANTY without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. Please refer to the licence for details.-java a powerful and efficient database SmallSQL Database is a free DBMS library for the Java (tm) platform. It runs on the Java 2 Platform (JDK 1.4 or later) and implements the JDBC 3.0 API.SmallSQL Database is licensed under the terms of the GNU Lesser GeneralPublic Licence (LGPL). A copy of the licence is included in thedistribution.Please note that SmallSQL Database is distributed WITHOUT ANY WARRANTY without even the implied warranty of MERCHANTAB

java客房管理系统-java客房管理系统！！！！！！！！！！

这是一道典型的动态规划题 提供了三种方法(用C++代码实现)-This a typical dynamic programming that provides three methods (using C code realization)

常用的几种排序算法的实现源码，同时还给出了几种排序算法的比较结果，源码中的排序内容都是随机产生的-several commonly used algorithm to achieve source, but also gives several algorithm result of the comparison, the ranking source content are randomly generated

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

本软件的前台设计由Visual Basic实现。利用Access用户界面工具进行数据库的创建和管理。本系统界面设计大方、简洁、实用，操作简单方便,是一款完全适合普通小区物业日常事务管理的软件。软件设计综合了具有一定代表性的多家物业管理公司的业务模式和需求。能实现房产、客户等小区的智能化管理，可以提高物业管理的效率。-The paper describes the design and realization of Property Manage System(PMS) .The foreground of the software is carried out by Visual Basic 6.0. Using the Access customer interface tool to create and manage the database. This interface of the system is generous, practical, with simple operational method, and it is also a software complete suiting the common Property business management.It synthesizes the requirement and business mode of many property management company in designing precess.It can realize the management of house property, customer in a small area of inhabitancy. And increase the efficiency of the property management.

自己学VB时数据库编程的一个小程序-studied VB Database Programming a small program