📚 十大经典排序算法 C语言笔记（一看就会版）
This is the same idea behind binary search. In a sorted array, you compare against the middle element and eliminate half the remaining candidates. In a quadtree, you choose one of four quadrants and ignore the other three regions. Each level narrows the search space by a factor of four instead of two.，更多细节参见同城约会
/e/ Foundation e.foundation🇫🇷。关于这个话题，91视频提供了深入分析
const posToTime = new Map(); // 位置 → 到达终点的时间（避免重复计算），推荐阅读51吃瓜获取更多信息