# devtools = true # default
* 时间复杂度：O(n)，空间复杂度：O(n)，推荐阅读旺商聊官方下载获取更多信息
Фото: Efrem Lukatsky / AP，推荐阅读服务器推荐获取更多信息
"But then you start to get out, and you see whales, seals and islands on boats, and then little trips out in small aircraft. And you think, 'this is pretty brilliant'. This year, I've been so lucky to see an emperor penguin colony. It's like something from a David Attenborough documentary."
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.