Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Non-Repetitive Random Numbers

by pemungkah (Priest)
on Apr 06, 2013 at 10:22 UTC ( #1027275=note: print w/ replies, xml ) Need Help??


in reply to Non-Repetitive Random Numbers

This survey of pseudorandom number generators has recommendations. There are many with a wide range of characteristics.

If you need a nice uniform distribution, the Mersenne Twister implementation provided by Math-Random-MT-Perl-1.1 should work. As the notes say, "The algorithm is characterised by a very uniform distribution but is not cryptographically secure."


Comment on Re: Non-Repetitive Random Numbers

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1027275]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (13)
As of 2015-07-01 18:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (16 votes), past polls