Image:Bogosort100 steps cdf.png
From Wikipedia, the free encyclopedia
Bogosort100_steps_cdf.png (320 × 200 pixel, file size: 2 KB, MIME type: image/png)
[edit] Summary
The 2006 June 4 Reference desk question Wikipedia:Reference desk/Mathematics#random drawing of numbers 1–100 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.
[edit] Licensing
I, the creator of this work, hereby release it into the public domain. This applies worldwide.
In case this is not legally possible,
I grant any entity the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
File history
Legend: (cur) = this is the current file, (del) = delete
this old version, (rev) = revert to this old version.
Click on date to download the file or see the image uploaded on that date.
- (del) (cur) 21:17, 5 June 2006 . . B jonas (Talk | contribs) . . 320×200 (1,681 bytes) (The 2006 June 4 Reference desk question Wikipedia:Reference desk/Mathematics#random drawing of numbers 1–100 describes an inefficent way to sort 100 numbers. It works by randomly partitioning the numbers in 10 groups of 10, sort each group, increas)
- Edit this file using an external application
See the setup instructions for more information.
