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中也有详细论述
Credit: Adam Doud / Mashable，详情可参考91视频
definition! Sometimes, it’s clear cut: For example, a clearly