搜索资源列表
最近点对问题，分别用蛮力法和分治法进行了求解
- 最近点对问题，分别用蛮力法和分治法进行了求解，算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
KitBag
- 分治法和蛮力法求解最近点对问题,不好意思中文传不了，改传背包问题了。-leastport
zuijindui
- 用蛮力法和分治法解最近对问题以及对算法时间性能及运行结果的分析 -And sub-rule by brute force method of solving the problem, as well as the recent performance of the algorithm and running time analysis of the results
shortestpath
- 用蛮力法和分治法求最近点对的问题-用蛮力法和分治法求最近点对的问题............
MinDistance_PointPair
- 用java实现的平面上最近点对的查找，包括蛮力法和分治法的实现。-Java implementation of the plane with the nearest point on the search, including the brute force method and the divide and conquer implementation.
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do
ClosestPoints
- 分治法和蛮力法求最近对问题及其时间复杂度比较-Divide and conquer method and the brute force method for the recent problems,and comparing the running time.