Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: Yet Another Fair Shuffle Node

by tall_man (Parson)
on Apr 04, 2005 at 19:46 UTC ( #444775=note: print w/ replies, xml ) Need Help??

in reply to Yet Another Fair Shuffle Node

I found a reference to the tagged sort as a shuffle once proposed by Knuth, so I withdraw by previous objections to it. As you point out, it is not as efficient as Fisher-Yates. But it will work.

Comment on Re: Yet Another Fair Shuffle Node

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (9)
As of 2015-07-06 11:53 GMT
Find Nodes?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...

    Results (73 votes), past polls