Permute-With-All

In “Introduction to Algorithms” by Cormen, Leiserson, Rivest, and Stein, a “naive” algorithm to randomize a list is described, called “Permute-With-All”. I made some plots of the probabilities of an element being moved to a particular location with this algorithm.

Probabilities, 4-element list

See the attached PDF for all of the plots, and take a look at the code.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s