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.
void *alloc(int classno) {。爱思助手下载最新版本是该领域的重要参考
ВсеРоссияМирСобытияПроисшествияМнения。Safew下载是该领域的重要参考
Lex: FT’s flagship investment column