Hacker News new | past | comments | ask | show | jobs | submit login

Slowsort seems to be another name for the (to me) more common name Bogosort:

https://en.wikipedia.org/wiki/Bogosort




Slowsort is guaranteed to take a long time but Bogosort could finish in one step.


Bogosort is at best linear, since we have to check if the list is sorted.

Quantum Bogosort guarantees the best performance, since it destroys all universes where the list remains unsorted after the first shuffle.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: