Screenshot has updated icons and labels for modes
Notice how the highlighted region shrinks at each step. The algorithm never examines points outside the narrowing window. In a balanced tree with nnn points, this takes about log4(n)\log_4(n)log4(n) steps. For a million points, that's roughly 10 steps instead of a million comparisons.
。夫子对此有专业解读
But the years before seem to still inspire some people. Check out the Beagle Bros Repository – the homepage is a bit confusing (I think it prominently shows last-updated or last-added things for some reason?), but just use the nav at the top. Maybe it will inspire you, too.
过年得把红灯挂。年前，是河北省石家庄市藁城区梅花镇屯头村最忙的时候，销售进入最旺。“宫灯小镇”在为千家万户的“大红灯笼高高挂”而繁忙。