汽车租赁系统

一个关于哈夫曼编码的程序，用c++编的。可用于对数距的编码-one of Huffman coding procedures, using the c series. For a few from the right coding

数据结构中的非波那起序列-data structure of the non-wave sequence since then

这个系统将特别为那些初学者提供帮助。。

二叉树的先序，中序，后序，按层遍历算法。以中序输入，用‘#’代替叶子节点的子节点输入。-binary tree first sequence, sequence after sequence, layer by traversal algorithm. The order to import, use "#" instead of the leaf nodes for input nodes.

利用C++对MYSQL进行数据读，写，及修改. 需要有mysql.h 头文件   数据库结名为person, 表名为 mm, 表结构如下：  字段             类型 device_id       int sav_value      int sav_date        datetime

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

我自己从oracle 805 提取得oracle精简客户端程序并且自己开发了一个添加tns的小工具-myself from the oracle oracle made mention 805 client streamline their procedures and the development of a small add tns tools

一个可以直接读写XML文件的delphi程序源码-dirct read&write XML

基于神经网络实现的JAVA代码，BP前缀型，使用简单。分为三个包，一个layer层，一个节点NODE 一个网络NETWORK。 基于神经网络实现的JAVA代码，BP前缀型，使用简单。分为三个包，一个layer层，一个节点NODE 一个网络NETWORK

小图书馆管理系统，有检索、查看，借书，超期表，还书，赔书等功能，还有按专业统计等，access小程序-small library management system, search, check the library and extended table, book, indemnities, and other functions, there are also professional statistics, the access of small procedures