Discussion on Hacker News
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.
，更多细节参见搜狗输入法2026
"Even the risk of that doesn't stop people from perpetrating fraud," Elahi marvelled.
阿嬷那年结婚刚满一年，家里没有孩子。一次偶然的机会，她去医院陪人看病，有人提起她一直没动静，她顺口说了一句：“我想买个孩子。”