-
一个非常有用的桌面管理程序
一个非常有用的桌面管理程序-a very useful desktop management procedures
- 2022-02-28 19:08:03下载
- 积分：1
-
文学修养，余秋雨文集，写得很深长，写得沉重。苍桑
文学修养，余秋雨文集，写得很深长，写得沉重。苍桑-literary accomplishment Yu Works, written long deep, heavy write. Cangsang
- 2022-05-16 18:56:38下载
- 积分：1
-
RA control of the sorting system to achieve another source :) in the company'...
RA控制分拣系统的另一个源代码实现：），可以在该公司的RSLogix5000软件下运行-RA control of the sorting system to achieve another source :) in the company"s software running RSLogix5000
- 2022-08-09 02:57:22下载
- 积分：1
-
C++Builder6做的一个俄罗斯方块游戏.
C++Builder6做的一个俄罗斯方块游戏.-C Builder6 do a Rubik"s cube game.
- 2023-06-25 01:45:03下载
- 积分：1
-
测试C语言子模块运行速度的C语言源程序
测试C语言子模块运行速度的C语言源程序-test C language module operating speed of C language source
- 2023-03-14 18:45:04下载
- 积分：1
-
MU地图文件的测试程序
MU地图文件的测试程序-MU map document testing procedures
- 2022-01-25 22:15:55下载
- 积分：1
-
shell教学视频，非常适合初学者。希望通过审核！
shell教学视频，非常适合初学者。希望通过审核！-shell teaching video, very suitable for beginners. Hope that through review!
- 2022-03-24 23:19:35下载
- 积分：1
-
AcrSde spatial database engine. Good things to share!
AcrSde 空间数据库引擎.
很好的东西发给大家共享！-AcrSde spatial database engine. Good things to share!
- 2023-06-17 20:50:06下载
- 积分：1
-
字模工具,用于嵌入式系统调试用,希望大家用得上
字模工具,用于嵌入式系统调试用,希望大家用得上-Fonts tool for debugging embedded system with the hope that we would apply
- 2022-02-05 17:41:37下载
- 积分：1
-
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小...
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
- 2022-01-25 16:01:13下载
- 积分：1
