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

Re: Randomize word

by zdog (Priest)
on Sep 12, 2004 at 07:17 UTC ( #390379=note: print w/ replies, xml ) Need Help??


in reply to Randomize word

If you only need one randomization, here's a solution I came up with:

my $word = "whatever"; print join '', sort { rand() <=> rand() } split //, $word;

Zenon Zabinski | zdog | zdog@perlmonk.org


Comment on Re: Randomize word
Download Code
Re^2: Randomize word
by ysth (Canon) on Sep 12, 2004 at 08:12 UTC
    Trying:
    $ perl -we'use Data::Dumper; ++$Data::Dumper::Sortkeys; ++$count{join +"", sort \ {rand()<=>rand()}split //, "abcde"} for 1..100000; print Dumper \%coun +t;'|less
    showed a very uneven distribution, though I couldn't make out what the determining factors were. Compare to:
    $ perl -we'use Data::Dumper; ++$Data::Dumper::Sortkeys; use List::Util + "shuffle"; \ ++$count{join "", shuffle split //, "abcde"} for 1..100000; print Dump +er \%count;'|less

      Good looking out: obviously not optimal. I tried to figure out for myself what was going wrong.

      First, I simplified the code itself a little further:

      print join "", sort { rand() <=> 0.5 } split //, "abcde";

      That does basically the same thing, except calls rand() once less per comparison.

      Staring at it didn't do much good for me so I came up with a little test script of my own:

      use strict; use warnings; sub compare { my ($a, $b) = @_; my $rand = rand(); print "$a: $rand; $b: 0.5\n"; return $rand <=> 0.5; } print join "", sort { compare($a, $b) } split //, "abcde";

      The output of which was something like:

      $ perl test.pl a: 0.876941476789401; b: 0.5 c: 0.0768385185833438; d: 0.5 b: 0.203632482365844; c: 0.5 c: 0.234952540459695; a: 0.5 a: 0.746254431212112; d: 0.5 b: 0.648884088019244; e: 0.5 ebcda

      After running this a few times and looking at the results, it hit me. This is going to be a rough explanation, but I'll give it a shot. After comparing the first four letters to one another it selects the "smallest" one (the one with the smallest rand() anyway) and compares it to the final letter: 'e' in this case. Because 'e' is the last to be compared (in the initial go, at least) and because the rand() number is regenerated at each comparison, it always has roughly a 50% chance of being the "smallest" since it has to only pass a single test to be the "smallest". The letters in front of it must not only pass their first test, but will always have to be compared to the letters following it, thus reducing their chances of being the "smallest".

      In this way, my "solution" favors the letters towards the end and is more likely to stick them in front. That's why the distribution is so uneven. If you follow sort()'s algorithm ( quicksort, I believe (C's qsort(), I think ) ) through, it'll make sense.

      I hope that makes some sense ...

      Zenon Zabinski | zdog | zdog@perlmonk.org

        Not C's qsort, nor by default a quicksort at all anymore. Note that on older perls (5.005ish?) that do use qsort, some platforms have a tendency to coredump if the sort routine provides inconsistent results. (Just heresay, never actually seen it myself.)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (7)
As of 2014-12-26 08:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (168 votes), past polls