Ibats and struts is a example of the integration, including a number of database...

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

有关数据库编程的方法-the database programming method

VFP学生管理系统，包括注册，管理以及数据统计-VFP student management system

数据结构的一种算法方式,生死游戏 的程序-data structure of an algorithm, the process of life and death game

一个关于二叉树的小实验例子，包括整个的过程文件-A small experiment on the binary tree example, including the whole process of document

SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.-SR-tree is an index structure for high-dimensional nearest neighbor queries,C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image/video applications.

输入以字符串，依顺序表存储，查找一个元素，删除一个元素-Input to a string, depending on the order of tables to store, find an element, delete an element

SQLite的封装类，简单实用，支持常用操作！ 自己感觉封装的不错，运行平台有：windows、linux、unix。 如果有什么问题和建议，请邮件yin0123@sina.com

快速数据库的编程实现-Rapid Database Programming

利用MD5函数产生随机的无碰撞的像素选择策略-The use of MD5 function produces a random collision-free pixel selection strategy