Random Sort is a way of sorting a list in O((n-1)! n^2) time.

The algorithm is simple:

1. Randomly order the list.

2. Check if it is sorted.

3. If not, return to step 1.

It certainly has impressive performance for large n. In practice it works well for n up to about 6, and slows considerably after this point. For large n better sorts are recommended, such as bubble sort ;-).

Log in or register to write something here or to contact authors.