If all you have is a hammer, everything looks like a nail. It's for this reason that computer scientists created bogobogosort (and sleepybogosort, as you mentioned). For example, bogobogosort tests memory cards more efficiently than a smaller-space algorithm like bogosort. In this case, the recursive nature of bogobogosort acts as space multiplier and fully fills the memory cards (be it DIMM or others). Don't be so quick to judge an algorithm just because it's new.
Also, I'm working on a Bogo programming language with randomized compilation; if anyone is interested in contributing, let me know.
Re:Bogo-bogosort
by egypturnash on Saturday December 28, 2013 @10:36PM
(#6978186)
I think half the point of this is the straight-faced, detailed examination of exactly how terrible this proposed sort is.
Or at least that's the part that made me start giggling...
No, since the complexity of bogosort with sleep is still O(n!), while the algorithm from OP has a higher bound.
Bogobogosort seems in the end to be no more worthwhile than sleepybogosort, where you must sleep() in between every operation.