Мерц резко сменил риторику во время встречи в Китае09:25
The algorithm walks the tree recursively. At each node, it checks: does this node's bounding box overlap with the query rectangle? If not, the entire subtree gets pruned (skipped). If it does overlap, it tests the node's points against the query and recurses into the children.
。同城约会是该领域的重要参考
重要：不要从手机自带的应用商店下载（基本上都没收录）
* @param arr 待排序数组