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.
Мерц резко сменил риторику во время встречи в Китае09:25
，更多细节参见WPS下载最新地址
Мощный удар Израиля по Ирану попал на видео09:41
FT Videos & Podcasts