(unknown)

Meino_Christian_Cra1 · 30 March 2006 20:33

Hi;

I am looking for an algorithm, which spread all 26 letters of the
alphabet over an array of 26 places randomly. All letters should be
statistically equally handled.

Thank you very much for any helpful reply !

Keep hacking!
mcc

James_Edward_Gray_II · 30 March 2006 20:39

Hi;

I am looking for an algorithm, which spread all 26 letters of the
alphabet over an array of 26 places randomly. All letters should be
statistically equally handled.

Well, this is only as good as the random number generator, but it sure is easy:

>> ("a".."z").sort_by { rand }
=> ["s", "m", "q", "j", "f", "r", "z", "e", "l", "k", "y", "v", "g", "d", "x", "p", "w", "a", "b", "c", "i", "t", "h", "o", "u", "n"]

Hope that helps.

James Edward Gray II

···

On Mar 30, 2006, at 2:33 PM, Meino Christian Cramer wrote:

Meino_Christian_Cra1 · 30 March 2006 20:57

Hi James,

again the ruby-effect: The way to code things in ruby is just too
straight forward and (only meant positively) simple.

Again, I was thinking way too complex.....with no result at all.

Thanks a lot!

Have a nice time!
mcc

···

From: James Edward Gray II <james@grayproductions.net>
Subject: Re:
Date: Fri, 31 Mar 2006 05:39:15 +0900

On Mar 30, 2006, at 2:33 PM, Meino Christian Cramer wrote:

> Hi;
>
> I am looking for an algorithm, which spread all 26 letters of the
> alphabet over an array of 26 places randomly. All letters should be
> statistically equally handled.

Well, this is only as good as the random number generator, but it
sure is easy:

>> ("a".."z").sort_by { rand }
=> ["s", "m", "q", "j", "f", "r", "z", "e", "l", "k", "y", "v", "g",
"d", "x", "p", "w", "a", "b", "c", "i", "t", "h", "o", "u", "n"]

Hope that helps.

James Edward Gray II

Meino_Christian_Cra1 · 30 March 2006 21:11

Hi,

sorry, me again.

If I want not only "a".."z" but also "A".."Z" I thought (from the
logical point of view...) that

>> a=("A".."z").sort_by { rand }

would work, but it gaves me:

>> a
=> ["P", "D", "Q", "N", "H", "A", "M", "X", "G", "C",
"E", "L", "I", "S", "B", "J", "F", "Y", "T", "Z", "V", "K", "O", "U", "R", "W"]

which isn't exactly, what I have exspected....

Unfortunately

a=("A".."Z").sort_by { rand } + ("a".."z").sort_by { rand }

would first randomize A->Z and then a->z and dont mix both.

Or am I not thinking too straight forward again ?

Keep hacking!
mcc

···

From: James Edward Gray II <james@grayproductions.net>
Subject: Re:
Date: Fri, 31 Mar 2006 05:39:15 +0900

On Mar 30, 2006, at 2:33 PM, Meino Christian Cramer wrote:

> Hi;
>
> I am looking for an algorithm, which spread all 26 letters of the
> alphabet over an array of 26 places randomly. All letters should be
> statistically equally handled.

Well, this is only as good as the random number generator, but it
sure is easy:

>> ("a".."z").sort_by { rand }
=> ["s", "m", "q", "j", "f", "r", "z", "e", "l", "k", "y", "v", "g",
"d", "x", "p", "w", "a", "b", "c", "i", "t", "h", "o", "u", "n"]

Hope that helps.

James Edward Gray II

James_Edward_Gray_II · 30 March 2006 21:20

Can you please title your messages so others know what we are talking about?

From: James Edward Gray II <james@grayproductions.net>
Subject: Re:
Date: Fri, 31 Mar 2006 05:39:15 +0900

Hi,

sorry, me again.

If I want not only "a".."z" but also "A".."Z"

We can just add the Arrays of letters, then randomize:

>> (("a".."z").to_a + ("A".."Z").to_a).sort_by { rand }
=> ["h", "j", "m", "x", "z", "O", "n", "r", "T", "F", "N", "k", "U", "a", "W", "p", "V", "E", "L", "A", "v", "D", "J", "P", "y", "C", "g", "u", "S", "i", "w", "q", "l", "K", "c", "B", "Z", "s", "t", "Y", "R", "e", "d", "o", "M", "I", "X", "f", "b", "G", "Q", "H"]

Hope that helps.

James Edward Gray II

···

On Mar 30, 2006, at 3:11 PM, Meino Christian Cramer wrote:

Daniel_Harple · 30 March 2006 21:21

Try:

(("a".."z").to_a + ("A".."Z").to_a).sort_by { rand }

-- Daniel

···

On Mar 30, 2006, at 11:11 PM, Meino Christian Cramer wrote:

I want not only "a".."z" but also "A".."Z"

Gary_Wright · 30 March 2006 21:22

a = (('a'..'z').to_a + ('A'..'Z').to_a).sort_by { rand }

Gary Wright

···

On Mar 30, 2006, at 4:11 PM, Meino Christian Cramer wrote:

If I want not only "a".."z" but also "A".."Z" I thought (from the
logical point of view...) that

a=("A".."z").sort_by { rand }

Timothy_Bennett · 30 March 2006 21:22

a = ("A".."Z" + "a".."z").sort_by { rand }

Tim

···

On Mar 30, 2006, at 1:11 PM, Meino Christian Cramer wrote:

From: James Edward Gray II <james@grayproductions.net>
Subject: Re:
Date: Fri, 31 Mar 2006 05:39:15 +0900

Hi,

sorry, me again.

If I want not only "a".."z" but also "A".."Z" I thought (from the
logical point of view...) that

a=("A".."z").sort_by { rand }

would work, but it gaves me:

a

=> ["P", "D", "Q", "N", "H", "A", "M", "X", "G", "C",
"E", "L", "I", "S", "B", "J", "F", "Y", "T", "Z", "V", "K", "O", "U", "R", "W"]

which isn't exactly, what I have exspected....

Unfortunately

a=("A".."Z").sort_by { rand } + ("a".."z").sort_by { rand }

would first randomize A->Z and then a->z and dont mix both.

Or am I not thinking too straight forward again ?

Keep hacking!
mcc

On Mar 30, 2006, at 2:33 PM, Meino Christian Cramer wrote:

Hi;

I am looking for an algorithm, which spread all 26 letters of the
alphabet over an array of 26 places randomly. All letters should be
statistically equally handled.

Well, this is only as good as the random number generator, but it
sure is easy:

("a".."z").sort_by { rand }

=> ["s", "m", "q", "j", "f", "r", "z", "e", "l", "k", "y", "v", "g",
"d", "x", "p", "w", "a", "b", "c", "i", "t", "h", "o", "u", "n"]

Hope that helps.

James Edward Gray II

baumanj · 30 March 2006 21:23

Not quite as elegant, but this should work:

(('a'..'z').to_a + ('A'..'Z').to_a).sort_by { rand }

Meino Christian Cramer wrote:

···

From: James Edward Gray II <james@grayproductions.net>
Subject: Re:
Date: Fri, 31 Mar 2006 05:39:15 +0900

Hi,

sorry, me again.

If I want not only "a".."z" but also "A".."Z" I thought (from the
logical point of view...) that

>> a=("A".."z").sort_by { rand }

would work, but it gaves me:

>> a
=> ["P", "D", "Q", "N", "H", "A", "M", "X", "G", "C",
"E", "L", "I", "S", "B", "J", "F", "Y", "T", "Z", "V", "K", "O", "U", "R", "W"]

which isn't exactly, what I have exspected....

Unfortunately

a=("A".."Z").sort_by { rand } + ("a".."z").sort_by { rand }

would first randomize A->Z and then a->z and dont mix both.

Or am I not thinking too straight forward again ?

Keep hacking!
mcc

> On Mar 30, 2006, at 2:33 PM, Meino Christian Cramer wrote:
>
> > Hi;
> >
> > I am looking for an algorithm, which spread all 26 letters of the
> > alphabet over an array of 26 places randomly. All letters should be
> > statistically equally handled.
>
> Well, this is only as good as the random number generator, but it
> sure is easy:
>
> >> ("a".."z").sort_by { rand }
> => ["s", "m", "q", "j", "f", "r", "z", "e", "l", "k", "y", "v", "g",
> "d", "x", "p", "w", "a", "b", "c", "i", "t", "h", "o", "u", "n"]
>
> Hope that helps.
>
> James Edward Gray II
>

Meino_Christian_Cra1 · 31 March 2006 04:16

Hi Tim,

this gives an error with my recent "stable-snapshot-ruby":

   >> a = ("A".."Z" + "a".."z").sort_by { rand }
   SyntaxError: compile error
   (irb):1: syntax error, unexpected tDOT2
   a = ("A".."Z" + "a".."z").sort_by { rand }
                        ^
           from (irb):1
   >>

Keep hacking!
mcc

···

From: Timothy Bennett <timothy.s.bennett@gmail.com>
Subject: Re:
Date: Fri, 31 Mar 2006 06:22:37 +0900

a = ("A".."Z" + "a".."z").sort_by { rand }

Tim

On Mar 30, 2006, at 1:11 PM, Meino Christian Cramer wrote:

> From: James Edward Gray II <james@grayproductions.net>
> Subject: Re:
> Date: Fri, 31 Mar 2006 05:39:15 +0900
>
> Hi,
>
> sorry, me again.
>
> If I want not only "a".."z" but also "A".."Z" I thought (from the
> logical point of view...) that
>
>>> a=("A".."z").sort_by { rand }
>
> would work, but it gaves me:
>
>>> a
> => ["P", "D", "Q", "N", "H", "A", "M", "X", "G", "C",
> "E", "L", "I", "S", "B", "J", "F", "Y", "T", "Z", "V", "K",
> "O", "U", "R", "W"]
>
> which isn't exactly, what I have exspected....
>
> Unfortunately
>
> a=("A".."Z").sort_by { rand } + ("a".."z").sort_by { rand }
>
> would first randomize A->Z and then a->z and dont mix both.
>
> Or am I not thinking too straight forward again ?
>
> Keep hacking!
> mcc
>
>
>
>> On Mar 30, 2006, at 2:33 PM, Meino Christian Cramer wrote:
>>
>>> Hi;
>>>
>>> I am looking for an algorithm, which spread all 26 letters of the
>>> alphabet over an array of 26 places randomly. All letters should be
>>> statistically equally handled.
>>
>> Well, this is only as good as the random number generator, but it
>> sure is easy:
>>
>>>> ("a".."z").sort_by { rand }
>> => ["s", "m", "q", "j", "f", "r", "z", "e", "l", "k", "y", "v", "g",
>> "d", "x", "p", "w", "a", "b", "c", "i", "t", "h", "o", "u", "n"]
>>
>> Hope that helps.
>>
>> James Edward Gray II
>>
>

Topic		Replies	Views
More random, please ! :) ruby-talk	3	66	6 April 2006
More random, please ! :) ruby-talk	0	52	6 April 2006
Need some Ruby magic ruby-talk	46	203	7 December 2005
Sorting by rand? ruby-talk	21	131	30 April 2007
Pseudo-randomize an array in a consistent order ruby-talk	23	176	4 July 2008

(unknown)

Related topics