I've noticed a difference between accessing a sorted set randomly versus accessing a randomized set randomly. I've not checked accessing a sorted set randomly versus accessing a randomized set sequentially.
NB: I always re-seed the random number generator with unique values (i.e. I dont repeat the seed value) before each random call.
A sound math/statistical explanation would be 8~)
--- On Fri, 1/22/10, Rad! <conradakunga@gmail.com> wrote:
From: Rad! <conradakunga@gmail.com>
Subject: Re: [Skunkworks] random sampling
To: "Skunkworks Forum" <skunkworks@lists.my.co.ke>
Date: Friday, January 22, 2010, 1:23 PM
I actually doubt there is any
difference in any of the three scenarios.
A - [1,2,3,4,5]
B - [5,1,4,2,3]
Given one pass to access each set, accessing set A randomly for values should give you results just as random as accessing set B regardless if randomly or in sequence
On Fri, Jan 22, 2010 at 2:15 PM, Nicholas Loki <lokimwenga@yahoo.com> wrote:
Hi Wesley/ Rad, How about this:
>> Or, for that matter, a randomized set sequentially
You get a sequential set of random values.
>> sorted set randomly You get a random value set with a high likelihood of some sortedness :-). >> randomized set randomly? Everything is random. Caveat: No scientific basis to my observations :-).
KR, Loki "Excellent people exceed expectations".
-----Inline Attachment Follows-----
|