Author(s): Quentin Bizot, Ryo Tamura, Guillaume Deffrennes
This is the same idea behind binary search. In a sorted array, you compare against the middle element and eliminate half the remaining candidates. In a quadtree, you choose one of four quadrants and ignore the other three regions. Each level narrows the search space by a factor of four instead of two.
，推荐阅读同城约会获取更多信息
Виктория Кондратьева (Редактор отдела «Мир»)
'We have a new major number purely because I'm easily confused and not good with big numbers' says Linus Torvalds about Linux 7.0