搜索资源列表
chesscover
- 此程序是关于算法设计与分析中的棋盘覆盖问题,采用分治策略实现的。-on algorithm design and analysis covering the chessboard, using the divide and conquer strategy to achieve.
yakun
- 归并排序,算法分析与设计第二章分治法思想的归并排序算法实现,用C++写的.-merge sorting algorithm analysis and design of the second chapter ideological divide-and-conquer method of merging ranking algorithm, C writes.
kuaisu
- 快速排序,算法分析与设计第二章分治法思想的快速排序算法实现.-quick sort, algorithm analysis and design of the second chapter ideological divide-and-conquer method of quick sort algorithm.
5.3
- 在数组中寻找最大元素.该算法采用分治算法.-in finding the greatest array elements. The algorithm used divide-and-conquer.
closestPairPoints
- 使用分治法求大量点中的最近点对.使用MFC做用户界面.10^6个点时间大约为0.1妙-Get the closest pair of points from points clouds by divide and conquer method. UI by MFC. It costs about 0.1 second computing from 1,000,000 points
PowerCO
- great source of conquer-this is just a great work for evry 1