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.
Follow topics & set alerts with myFT
，更多细节参见91视频
Ядовитая красотаПогоня за загорелой кожей веками убивала женщин. От солярия их не отучил даже рак14 июля 2020
Upgrade to 400 credits per month with up to 100 plagiarism checks.