Hacker Times
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
deletes
on Dec 28, 2013
|
parent
|
context
|
favorite
| on:
Bogo-bogosort
No, since the complexity of bogosort with sleep is still O(n!), while the algorithm from OP has a higher bound.
lilyball
on Dec 29, 2013
[–]
Depends on how you do the sleeps.
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
