The Sorting Algorithm That Makes Spatial Indexing Look Stupid
A simple algorithm that sorts 2D points on alternating axes can build a spatially coherent grid without any distance-aware data structures. This insight challenges the assumption that spatial indexing requires complexity—and suggests that the most optimized primitive in computing (sorting) might be all you need.