File:Bogosort100 steps cdf.png

Summary
The 2006 June 4 Reference desk question Reference desk/Mathematics describes an inefficient way to sort 100 numbers. It works by randomly partitioning the numbers in 10 groups of 10, sort each group, increasing the weight of each number by its position in its group, then scrambling the numbers again, and repeating this until the weights are strictly ordered the same order as the numbers. This image is a graph of the cdf of the number of steps needed to sort the numbers this way. It is not the exact function, only the empirical cdf from a simulation of 13919 independent runs of the sort.

I, User:B jonas have made the graph with gnuplot from the data I've got myself from a simulation of the problem using scripts I wrote. I hereby release this image to public domain.

The graph is supplied as-is without any warranty. I might have made mistakes during the computation.