Re:Bead sort: faster than O(N log N) sort
by prodigal_erik on Monday June 22, 2009 @04:33AM
(#668437)
If you have to represent each value in unary, how can you even set up the input and read the results in less than O(N^2), much less carry out the "fall"?
[ Parent
| on HN ]
There are no comments on this comment yet.