> It's a little surprising that this works at all, since the partitioning step in the radix sort is itself the same kind of sharding operation. The key propert

> It's a little surprising that this works at all, since the partitioning step in the radix sort is itself the same kind of sharding operation. The key property here is the number of groups. When sharding data to n groups, only n locations have to be stored in cache -- the tails of the groups. In my radix sort implementation, this is just 256 locations, which works well with cache.