- Category:
- Other systems
- Tags:
-
- File Size:
- 2kb
- Update:
- 2018-04-11
- Downloads:
- 0 Times
- Uploaded by:
- 小宇哈哈哈
Description: The steps of the algorithm are as follows:
1., find out the median of Sx: median_Sx; use median_Sx to divide the point set S; the left side is S1, and the S2 on the right is S2.
T (n) = 2*T (n/2) + merge complexity. When merging, it is compared with the n/2 points in S1 and the most 6 points in S2. The number of comparisons is n/2 * 6 = 3n..
T (n) = 2*T (n/2) +O (n). From the main theorem, we know T (n) = O (n*log (n)).
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 新建文本文档 (3).txt | 8852 | 2018-04-11 |
Download