Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re: Array Shuffle

by Thelonius (Priest)
on Feb 28, 2006 at 03:19 UTC ( [id://533237]=note: print w/replies, xml ) Need Help??


in reply to Array Shuffle

I don't have a solution to this, but an interesting bit of mathematical trivia is that if you shuffle at random the odds that none of the elements ends up in the original space approaches 1/e as n -> infinity.

Replies are listed 'Best First'.
Re^2: Array Shuffle
by QM (Parson) on Feb 28, 2006 at 18:24 UTC
    So on average, for large n, 3 shuffles should suffice?

    -QM
    --
    Quantum Mechanics: The dreams stuff is made of

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://533237]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chilling in the Monastery: (3)
As of 2024-06-18 03:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    erzuuli‥ 🛈The London Perl and Raku Workshop takes place on 26th Oct 2024. If your company depends on Perl, please consider sponsoring and/or attending.