There's faster sorting algorithms: 1) ZEN sort: O(0) a) It is build on the realisation that it is all about numbers that do not really mean anything. b) It c

There's faster sorting algorithms: 1) ZEN sort: O(0) a) It is build on the realisation that it is all about numbers that do not really mean anything. b) It converges to NOTHINGNESS.. while it deletes all data there is. 2) Intelligent design sort (also known as miracle sort) O(1) 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. 3) Numerology Sort: O(n) a) Employ gematria to calculate a divine hash sum of all the elements of the array, taking O(n) time. The specific method depends on the data type, and is left as an exercise to the reader. b) Use this value to seed your PRNG. c) Using the PRNG, sample pairs of indices and swap the indicated elements. Do this 4n times. d) If the array is not sorted at this point, you have likely made an error in computing your hash. A debugging message is numerologically embedded in the output array that will guide you. (Gematria: https://en.wikipedia.org/wiki/Gematria https://en.wikipedia.org/wiki/Gematria ) 4) Sleep sort: O(largest number to be sorted) a) read a number to be sorted, call it n b) start a new thread, that sleep n seconds c) insert the number in the result array 5) Chuck Norris sort Chuck Norris once wrote by far the fastest sort algorithm ever. In Python: def sort(x): # I will roundhouse kick any array that isn't sorted at this point. Twice. return x