AboutWhat Happens at YC?ApplyYC Interview GuideFAQPeopleYC BlogCompaniesStartup DirectoryFounder DirectoryLaunch YCLibraryPartnersResourcesStartup SchoolNewsletterRequests for StartupsFor InvestorsVerify FoundersHacker NewsBookfaceSafeFind a Co-FounderStartup JobsLog inApplyUbicloudOpen source alternative to AWS
* 基数排序（LSD：最低位优先）
，这一点在一键获取谷歌浏览器下载中也有详细论述
圖像加註文字，谷愛凌和粉絲「荒謬的觀點」與「令人失望的決定」
The pruned nodes (in red) represent entire regions of space that the algorithm never examines. The points inside those regions are never checked. Compare the "Nodes Visited" count to the total number of points. The quadtree is doing far less work than a brute-force scan.