News for hackers. Stuff that matters.
Re:How to pair socks from a pile efficiently? by pbiggar on Saturday January 19, 2013 @11:39PM (#5086025)
You recursively sort each bucket into subbuckets, and there is a known recursion limit (3 in this case).

Here's code for an LSB radix sort, which doesn't recurse, but is the same idea: https://github.com/pbiggar/sorting-branches-caching/blob/mas...

There are no comments on this comment yet.