搜索资源列表
最近点对问题,分别用蛮力法和分治法进行了求解
- 最近点对问题,分别用蛮力法和分治法进行了求解,算法已经做过优化-Nearest point on the issue, respectively, and with brute force method for solving divide and conquer algorithm optimization has been done
main6
- C语言编写的命令行程序,通过蛮力法、动态规划、分治法求最大字段和,并进行算法效率比较。-C language command-line program, through brute force method, dynamic programming, divide and conquer method for maximum field and, and compare efficiency of the algorithm.