ВсеРоссияМирСобытияПроисшествияМнения
Essential digital access to quality FT journalism on any device. Pay a year upfront and save 20%.
。关于这个话题，heLLoword翻译官方下载提供了深入分析
Site feedback:Take our SurveyNew Window
For well-distributed points, nearest neighbor search is often near O(logn)O(\log n)O(logn) in practice. In the worst case (all points clustered tightly or along a line), it can degrade to O(n)O(n)O(n), but this is uncommon with typical spatial data.