Browse thread
[Caml-list] Explaining bit sets
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Noel Welsh <noelwelsh@y...> |
| Subject: | Re: [Caml-list] Holding a set of random integers of very wide range? |
--- john.chu@east.sun.com wrote: > For reasons I tried to explain in a previous draft > of this e-mail and > has been cut due to the amount of space it took, I > need to generate > multiple permuted lists of integers ranging from 0 > to approximately > 2^100 (or more, it's a bit open-ended > unfortunately). How about using a linear-congruential random number generators. These simple algorithms will generate numbers that don't repeat for a long period of time (typically they use 32bit integers but I'm sure you'll be able to find algorithms that generate numbers in a larger range). You can generate permutations of by setting the seeds to different values. HTH, Noel __________________________________________________ Do You Yahoo!? Yahoo! Finance - Get real-time stock quotes http://finance.yahoo.com ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners