1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
<TITLE>rand</TITLE>
<body bgcolor="#ffffcc">
<hr>
<pre>
<h3>RAND(3) Linux Programmer's Manual RAND(3)
</h3>
<h3>NAME
</h3> rand, srand - random number generator.
<h3>SYNOPSIS
</h3> #include <stdlib.h>
int rand(void);
void srand(unsigned int seed);
<h3>DESCRIPTION
</h3> The rand() function returns a pseudo-random integer
between 0 and RAND_MAX.
The srand() function sets its argument as the seed for a
new sequence of pseudo-random integers to be returned by
rand(). These sequences are repeatable by calling srand()
with the same seed value.
If no seed value is provided, the rand() function is auto-
matically seeded with a value of 1.
<h3>RETURN VALUE
</h3> The rand() function returns a value between 0 and
RAND_MAX. The srand() returns no value.
<h3>NOTES
</h3> The versions of rand() and srand() in the Linux C Library
use the same random number generator as random() and sran-
dom(), so the lower-order bits should be as random as the
higher-order bits. However, on older rand() implementa-
tions, the lower-order bits are much less random than the
higher-order bits.
In Numerical Recipes in C: The Art of Scientific Computing
(William H. Press, Brian P. Flannery, Saul A. Teukolsky,
William T. Vetterling; New York: Cambridge University
Press, 1990 (1st ed, p. 207)), the following comments are
made:
"If you want to generate a random integer between 1
and 10, you should always do it by
j=1+(int) (10.0*rand()/(RAND_MAX+1.0));
and never by anything resembling
j=1+((int) (1000000.0*rand()) % 10);
(which uses lower-order bits)."
Random-number generation is a complex topic. The Numeri-
cal Recipes in C book (see reference above) provides an
excellent discussion of practical random-number generation
issues in Chapter 7 (Random Numbers).
<h3>GNU 18 May 1995 1
</h3>
<h3>RAND(3) Linux Programmer's Manual RAND(3)
</h3>
For a more theoretical discussion which also covers many
practical issues in depth, please see Chapter 3 (Random
Numbers) in Donald E. Knuth's The Art of Computer Program-
ming, volume 2 (Seminumerical Algorithms), 2nd ed.; Read-
ing, Massachusetts: Addison-Wesley Publishing Company,
1981.
<h3>CONFORMING TO
</h3> SVID 3, BSD 4.3, ISO 9899
</pre>
<hr>
<h3>SEE ALSO
</h3><p>
<a href=random.htm>random</a>,
<a href=srandom.htm>srandom</a>,
<a href=initstate.htm>initstate</a>,
<a href=setstate.htm>setstate</a>,
<pre>
<h3>GNU 18 May 1995 2
</h3>
</pre>
<P>
<hr>
<p>
<center>
<table border=2 width=80%>
<tr align=center>
<td width=25%>
<a href=../cref.html>Top</a>
</td><td width=25%>
<a href=../master_index.html>Master Index</a>
</td><td width=25%>
<a href=../SYNTAX/keywords.html>Keywords</a>
</td><td width=25%>
<a href=../FUNCTIONS/funcref.htm>Functions</a>
</td>
</tr>
</table>
</center>
<p>
<hr>
This manual page was brought to you by <i>mjl_man V-2.0</i>
|
