compareCount++;
All got quiet. Then, a few days later, another identical flag.
，更多细节参见WPS官方版本下载
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.
Scroll to load interactive demo