This question is about a comment in this question
Recommended way to initialize srand? The first comment says that srand()
should be called only ONCE in an application. Why is it so?
相关问题
- Multiple sockets for clients to connect to
- What is the best way to do a search in a large fil
- glDrawElements only draws half a quad
- Index of single bit in long integer (in C) [duplic
- Equivalent of std::pair in C
1\Seems every time rand() runs, it will set a new seed for the next rand().
2\If srand() runs multiple times, the problem is if the two running happen in one second(the time(NULL) does not change), the next rand() will be the same as the rand() right after the previous srand().
A simpler solution for using
srand()
for generating different seeds for application instances run at the same second is as seen.This method makes your seed very close to random as there is no way to guess at what time your thread started and the pid will be different also.
srand seeds the pseudorandom number generator. If you call it more than once, you will reseed the RNG. And if you call it with the same argument, it will restart the same sequence.
To prove it, if you do something simple like:
you will see the same number printed 100 times.
Short answer: calling
srand()
is not like "rolling the dice" for the random number generator. Nor is it like shuffling a deck of cards. If anything, it's more like just cutting a deck of cards.Think of it like this.
rand()
deals from a big deck of cards, and every time you call it, all it does is pick the next card off the top of the deck, give you the value, and return that card to the bottom of the deck. (Yes, that means the "random" sequence will repeat after a while. It's a very big deck, though: typically 4,294,967,296 cards.)Furthermore, every time your program runs, a brand-new pack of cards is bought from the game shop, and every brand-new pack of cards always has the same sequence. So unless you do something special, every time your program runs, it will get exactly the same "random" numbers back from
rand()
.Now, you might say, "Okay, so how do I shuffle the deck?" And the answer is (at least as far as
rand
andsrand
are concerned), there isn't a way of shuffling the deck.So what does
srand
do? Based on the analogy I've been building here, callingsrand(n)
is basically like saying, "cut the deckn
cards from the top". But wait, one more thing: it's actually take another brand-new deck and cut itn
cards from the top.So if you call
srand(n)
,rand()
,srand(n)
,rand()
, ..., with the samen
every time, you won't just get a not-very-random sequence, you'll actually get the same number back fromrand()
every time. (Not necessarily the same number you handed tosrand
, but the same number back fromrand
over and over.)So the best you can do is to cut the deck once, that is, call
srand()
once, at the beginning of your program, with ann
that's reasonably random, so that you'll start at a different random place in the big deck each time your program runs.[P.S. Yes, I know, in real life, when you buy a brand-new deck of cards it's typically in order, not in random order. For the analogy here to work, I'm imagining that each deck you buy from the game shop is in a seemingly random order, but the exact same seemingly-random order as every other deck of cards you buy from that same shop. Sort of like the identically shuffled decks of cards they use in bridge tournaments.]
Random numbers are actually pseudo random. A seed is set first, from which each call of
rand
gets a random number, and modifies the internal state and this new state is used in the nextrand
call to get another number. Because a certain formula is used to generate these "random numbers" therefore setting a certain value of seed after every call torand
will return the same number from the call. For examplesrand (1234); rand ();
will return the same value. Initializing once the initial state with the seed value will generate enough random numbers as you do not set the internal state withsrand
, thus making the numbers more probable to be random.Generally we use the
time (NULL)
returned seconds value when initializing the seed value. Say thesrand (time (NULL));
is in a loop. Then loop can iterate more than once in one second, therefore the number of times the loop iterates inside the loop in a secondrand
call in the loop will return the same "random number", which is not desired. Initializing it once at program start will set the seed once, and each timerand
is called, a new number is generated and the internal state is modified, so the next callrand
returns a number which is random enough.For example this code from http://linux.die.net/man/3/rand:
The internal state
next
is declared as global. Eachmyrand
call will modify the internal state and update it, and return a random number. Every call ofmyrand
will have a differentnext
value therefore the the method will return the different numbers every call.Look at the
mysrand
implementation; it simply sets the seed value you pass tonext
. Therefore if you set thenext
value the same everytime before callingrand
it will return the same random value, because of the identical formula applied on it, which is not desirable, as the function is made to be random.But depending on your needs you can set the seed to some certain value to generate the same "random sequence" each run, say for some benchmark or others.
That depends on what you are trying to achieve.
Randomization is performed as a function that has a starting value, namely the seed.
So, for the same seed, you will always get the same sequence of values.
If you try to set the seed every time you need a random value, and the seed is the same number, you will always get the same "random" value.
Seed is usually taken from the current time, which are the seconds, as in
time(NULL)
, so if you always set the seed before taking the random number, you will get the same number as long as you call the srand/rand combo multiple times in the same second.To avoid this problem, srand is set only once per application, because it is doubtful that two of the application instances will be initialized in the same second, so each instance will then have a different sequence of random numbers.
However, there is a slight possibility that you will run your app (especially if it's a short one, or a command line tool or something like that) many times in a second, then you will have to resort to some other way of choosing a seed (unless the same sequence in different application instances is ok by you). But like I said, that depends on your application context of usage.
Also, you may want to try to increase the precision to microseconds (minimizing the chance of the same seed), requires (
sys/time.h
):