1. RE: An Applied Algorithmic Activity:
Hi, Mr. Trick
Please take a look to my General Functions. I have three different methods
to do what you need, and one of them uses some kind of a "hash" function, or
better, a special random number generator.
Regards.
----- Original Message -----
From: Patrick Barnes <mrtrick at gmail.com>
To: <EUforum at topica.com>
Sent: Tuesday, June 29, 2004 3:23 AM
Subject: An Applied Algorithmic Activity:
>
>
> Lets say we want to step through the numbers 1 to N, in a particular
> order. The order of the numbers can be arbitrary, but each number can
> only be visited once, and the order of the visits should be seeded by
> a number passed to it.
>
> For example:
> 1923840657
> 0123456798
> 7648235910
>
> It seems like it needs some sort of hash value, but I couldn't for the
> life of me figure out how.
> How would you suggest I do this? Each seed doesn't have to generate a
> unique result, but it would be nice. 
> --
> MrTrick
>
>
>
>
