New blog post: Sorting with integer offsets https://11011110.github.io/blog/2020/06/28/sorting-integer-offsets.html
For inputs and a parameter , sorting the set more quickly than a pure comparison sort is a nice exercise in radix sorting. But sorting the very similar-looking set seems much harder. Why? And what does this all have to do with greedy set cover?