How inefficient can a sort algorithm be? · HackerPapers discussions

How inefficient can a sort algorithm be? — mentioned by antognini

Tue, 05 Oct 2021 16:19:08 GMT

Bogosort is pretty simple, too. while not is_sorted(a) do shuffle(a) However the shuffle function hides a surprising amount of complexity. It is nontrivial to write a correct shuffle function. [1] But Bogosort isn't even the worst sorting algorithm out there! There is also Worstsort [2]. [1]: https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle [2]: https://arxiv.org/abs/1406.1077

Paper and discussion history. A mention is not an endorsement.

How inefficient can a sort algorithm be? — mentioned by brudgers

Sun, 12 Jun 2016 14:06:45 GMT

Direct link to paper: https://arxiv.org/pdf/1406.1077v1

Paper and discussion history. A mention is not an endorsement.

How inefficient can a sort algorithm be? — HN submission

Sun, 12 Jun 2016 10:53:40 GMT

How inefficient can a sort algorithm be?

2 points; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.