Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: Bug in List::Util::shuffle ?

by PetaMem (Priest)
on Mar 23, 2009 at 08:58 UTC ( #752536=note: print w/ replies, xml ) Need Help??

in reply to Bug in List::Util::shuffle ?

Well - maybe not a bug, but does anyone know the answer to the question in this thread 5 years ago?

I asked myself the same question today. Unfortunately, the List::Util POD doesn't answer it, neither does the source or (lack of) remarks.

It certainly doesn't look like the Fisher-Yates described in the Perl Cookbook on p. 121

    All Perl:   MT, NLP, NLU

Comment on Re: Bug in List::Util::shuffle ?
Replies are listed 'Best First'.
Re^2: Bug in List::Util::shuffle ?
by Corion (Pope) on Mar 23, 2009 at 09:09 UTC

    The implementation seems to be identical to the modern version of the Fisher-Yates shuffle, as found again by Richard Durstenfeld and published by Donald Knuth.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (7)
As of 2015-10-08 16:26 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (221 votes), past polls