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

Answer 1

The "what would you like it to be?" sort

1. Note the system time.
2. Sort using Quicksort (or anything else reasonably sensible), omitting the very last swap.
3. Note the system time.
4. Calculate the required time. Extended precision arithmetic is a requirement.
5. Wait the required time.
6. Perform the last swap.

Not only can it implement any conceivable O(x) value short of infinity, the time taken is provably correct (if you can wait that long).