News for hackers. Stuff that matters.
Re:Sleep sort (2011) by asdfaoeu on Friday December 26, 2014 @02:29AM (#8798354)
the max size of the elements is usually constant when comparing sorting algorithms. The complexity of this depends on the algorithm of the scheduler. With the right scheduler this could be O(nlog n).

There are no comments on this comment yet.