News for hackers. Stuff that matters.

A comment on Pessimal Algorithms and Simplexity Analysis [pdf]. Parent comment

Re:Pessimal Algorithms and Simplexity Analysis [pdf] by ruph123 on Tuesday April 13, 2021 @10:56AM (#26793031)
Slowsort seems to be another name for the (to me) more common name Bogosort:

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

[ Parent | on HN ]
Re:Pessimal Algorithms and Simplexity Analysis [pdf] by whatshisface on Tuesday April 13, 2021 @10:58AM (#26793062)
Slowsort is guaranteed to take a long time but Bogosort could finish in one step.
[ Parent | on HN ]
Re:Pessimal Algorithms and Simplexity Analysis [pdf] by chriswarbo on Tuesday April 13, 2021 @11:52AM (#26794050)
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.

[ Parent | on HN ]