图书管理系统

归并排序：将数组划分为小数组,通过局部的有序合并,解决问题 算法平均时间复杂度: O(nlogn) -Merging Sort: The array is divided into a small array, in an orderly manner through the partial merger, the average time algorithm to solve the problem complexity: O (nlogn)

二叉树的实现，包括各种遍历-binary tree to achieve, including Traversal

多中通用排序算法组合源码，不好用你找我.-Sorting algorithm and more general source portfolio, not me with you.

数据结构相关知识写的，二分查找的相关代码-2 minutes to find the relevant code

自己帮家里人写的一个废品收购管理数据库系统，数据库用的access，界面用的VC-To help people write their own home to buy a waste management database system, the database used access, interface with the VC

本书总结了历届国际奥林匹克竞赛（IOI）的试题特点及我国参赛选手的培训经验。书中许多例题取自历届大赛的试题及中国队选手的训练题目，针对问题讲解了解题的关键思路及如何灵活运用有关的算法知识。-the book summarizes the successive international Olympiad (IOI) and the characteristics of the questions my players training experience. Many examples from the book the previous contest questions and the Chinese team"s training topics dealing with the problem of solving the problems on the key ideas and how flexible use of the algorithm knowledge.

改进的矩阵操作类,增加了诸如对矩阵任意行/列的存取,矩阵的积分图像的计算等-improved matrix operations, such as the right to increase the matrix arbitrary line/column access, image matrix of the integral calculation

如果要连接的数据库文件和当前文件在同一个目录下-If you want to connect to the database file and the current document in the same directory

一个关于VCD销售的系统，界面做得很好看的！我觉得！-a VCD sales of the system, the interface do look good! I think!

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.