The anti-algorithm: randomly shuffle the array, then check if it happens to be sorted. If not, shuffle again. And again. And again...
Worst: O(∞) unbounded!
Average: O(n × n!)
Best: O(n) (already sorted)
Space: O(1)
For 6 elements, expect ~720 shuffles on average. Don't try this on real data.