Want to add more newsletters?
2026-02-28 00:00:00:0周小霞3014274110http://paper.people.com.cn/rmrb/pc/content/202602/28/content_30142741.htmlhttp://paper.people.com.cn/rmrb/pad/content/202602/28/content_30142741.html11921 黔北灰豆腐（多味斋）
，更多细节参见51吃瓜
int arr[] = {64, 34, 25, 12, 22, 11, 90};
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.