News for hackers. Stuff that matters.
Re:Bead sort: faster than O(N log N) sort by karanbhangui on Monday June 22, 2009 @03:49AM (#668409)
I thought about this sort on my own a couple years ago, and I thought I'd discovered the most amazing thing in sorting :P

Not only did I realize I was beaten to the punch few years earlier, but also that efficiency is lost in implementation.

There are no comments on this comment yet.