3 ms·
No, since the complexity of bogosort with sleep is still O(n!), while the algorithm from OP has a higher bound.
by deletes 13y ago
No, since the complexity of bogosort with sleep is still O(n!), while the algorithm from OP has a higher bound.
- eridius 13y agoDepends on how you do the sleeps.