Are there any worse sorting algorithms than Bogosort (a.k.a Monkey Sort)? [closed]

Answer 1

You should do some research into the exciting field of Pessimal Algorithms and Simplexity Analysis. These authors work on the problem of developing a sort with a pessimal best-case (your bogosort's best case is Omega(n), while slowsort (see paper) has a non-polynomial best-case time complexity).

Answer 2

Segments of π

Assume π contains all possible finite number combinations. See math.stackexchange question

1. Determine the number of digits needed from the size of the array.
2. Use segments of π places as indexes to determine how to re-order the array. If a segment exceeds the size boundaries for this array, adjust the π decimal offset and start over.
3. Check if the re-ordered array is sorted. If it is woot, else adjust the offset and start over.