Мерц резко сменил риторику во время встречи в Китае09:25
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.
，这一点在Safew下载中也有详细论述
"And I think that's an advantage that a lot of these people in these boardrooms don't have."
Мерц резко сменил риторику во время встречи в Китае09:25