hash 文件操作（数据结构）

/*最大k乘积问题 问题描述: 设I是一个n位十进制整数。如果将I划分为k段，则可得到k个整数。这k个整数的乘积称为I的一个k乘积 。 试设计一个算法，对于给定的I和k，求出I的最大k乘积（n

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

ACESS数据库使用时间长了之后,数据库文件后变得越来越庞大,本程序里的函数可以实现对ACESS进行压缩 另外,当机器突然断电,可能对DB造成损坏,该函数也可实现修复-Acess database to use a long time after the database file after becoming increasingly large, the program can realize the function of Acess to compress the other hand, when a sudden power failure the machine may cause damage to DB, this function can also realize Repair

某正在运行的大型医院源程序，PB+SQLSERVER设计，对程序开发和设计非常有参考和借鉴作用，赶快下栽吧-are running a large hospital source, PB SQLSERVER design, procedures for the development and design of information and very useful, it quickly crashed

数据库基础知识的笔记题集,对初学者进行复习很有用-database

数据库系统：访问数据库。访问数据库并能对出错进行捕捉-database system : access to the database. Access to the database and is able to capture for mistakes

ＰＯＪ　１１６６己ＡＣ源代码，不信你可以试试．-POJ 1166 F AC source code, do not believe you can try.

计算圆周率 Pi (π)值, 精确到小数点后 10000 位 只需要 30 多句代码！-Pi calculated pi () values, accurate to 10,000 decimal places only need more than 30 sentence code!

本人上传的是用贪心算法实现找零钱问题。贪婪算法的根本思想是逐步获得最优解。-I uploaded is to use greedy algorithm to find small change problem. Greedy algorithm is the fundamental idea is to gradually get the optimal solution.

书中共介绍了四类排序函数：插入排序、起泡排序、选择排序、快速排序。我们需要建立一个无序随机序列，分别用上述排序方法对建立的无序序列有序化，编写相应的程序计算每种算法的赋值次数、比较次数以及所用时间，以此为依据来判断各种算法的效率。-introduced a total of four ranking functions : insertion sort, bubble sort, select, in order of Quick Sort. We need to build a disorderly random sequence, the use of such methods of sequencing to establish an orderly sequence of the disorder, and the preparation of the corresponding procedures of each algorithm for the calculation of frequency assignment, as well as comparison with the number of time, using this as the basis to judge the efficiency of algorithms.