Save StorySave this story
人 民 网 版 权 所 有 ，未 经 书 面 授 权 禁 止 使 用
，这一点在快连下载安装中也有详细论述
any reallocation.
The algorithm also visits children in order of distance to the query point. This means it checks the most promising quadrants first, which tends to find a good candidate early and enables aggressive pruning of the remaining quadrants. Without this ordering, the algorithm would still produce the correct result, but it would prune fewer nodes.