Heh.Morgan-Mar offers a short complexity analysis of the algorithm and finds that, marvelously, it has no complexity at all! It's so simple and efficient that it doesn't even require a computer. "Praise the Sorter!," he writes.But wait … what are the implications of such an algorithm? Morgan-Mar includes the following proof submitted by Krishna Kumar, who is presumably another fan of esoteric programming languages/algorithms.The probability of the original input list being in the exact order it's in is 1/(n!). There is such a small likelihood of this that it's clearly absurd to say that this happened by chance, so it must have been consciously put in that order by an intelligent Sorter. Therefore it's safe to assume that it's already optimally Sorted in some way that transcends our naïve mortal understanding of "ascending order". Any attempt to change that order to conform to our own preconceptions would actually make it less sorted.
A corollary: All elements are created equal under the Sorter.
Ka-boom.Proof: Take a random permutation of the input list; this second list is also Sorted by the same argument as above. This means that any two elements in the two lists with the same index are equal to each other. But the second list was a random permutation; which indicates that every element in the original list is equal to every other element. QED.