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.
"No one's normal. It just looks that way from across the street."
，推荐阅读搜狗输入法2026获取更多信息
Urgent research needed to tackle AI threats, says Google AI boss
深度横评：2026 年，AI 生成 PPT 到底进化到什么程度了？