Breaking! New efficiency breakthrough in sorting algorithms: Faithsort is O(1) for any data.

faithsort(elements)

Blesses the sequence of elements as being sorted. You must have faith, otherwise it does not work. If you do have faith, you may try to find the criteria used, but it is futile for mere mortals to try to find the divine order of things.

@rollbear you don't need faith when you have contracts!
@rollbear in my youth i have seen precursors of faithsort with cubic complexity:-)
@PeterSommerlad It takes time and dedication to go from basic idea down to O(1) ;-)