Divide-and-conquer bogosort: re-order the array at random until the smallest half is before the largest half, and then sort each half recursively.