针对金块问题，分别采用蛮力法和二分法，并用C++语言时间-With brute force method and dichotomy to solve gold bullion problems

ANN是一个构造数据索引结果的程序，可以实现最近邻、KD树等功能。ANN is designed for data sets that are small enough that the search structure can be stored in main memory (in contrast to approaches from databases that assume that the data resides in secondary storage). Points ar

用遗传算法、贪心算法以及穷举法对TSP问题进行求解-Genetic algorithm, the greedy algorithm and the brute-force method to solve the TSP problem

数据挖掘Aprior的简易c++实现，通过string来表示数据集，没有采用STL set集合操作，因此实现起来简单一些，判断是否包含用到了动态规划算法中的最长公共子序列，思想是暴力求解，没有用到很高端的思想和算法。(Simple c++ data mining Aprior, said data set by the string, without the use of STL set collection operation, thus the realization is simple,