OpenEuphoria

An Applied Algorithmic Activity:

• Posted by Patrick Barnes <mrtrick at gmail.com> Jun 29, 2004
• 443 views

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