Xref: utzoo comp.sources.d:4518 comp.sources.games.bugs:1358
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!rutgers!columbia!cunixc!shenkin
From: shenkin@cunixc.cc.columbia.edu (Peter S. Shenkin)
Newsgroups: comp.sources.d,comp.sources.games.bugs
Subject: Re: travestyyyyyyyy
Message-ID: <2597@cunixc.cc.columbia.edu>
Date: 5 Jan 90 17:19:09 GMT
References: <815@stealth.acf.nyu.edu>
Reply-To: shenkin@cunixc.cc.columbia.edu (Peter S. Shenkin)
Distribution: usa
Organization: Columbia University
Lines: 15

In article <815@stealth.acf.nyu.edu> brnstnd@stealth.acf.nyu.edu (Dan Bernstein) writes:
>
>Yes, Peter, you can replace srandom() and random() by srand() and
>rand(). random() and srandom() are two of those annoying routines that
>work much better than their predecessors but aren't as widely available;

Careful, though;  with rand() and srand(), only the 16 high-order bits
have any semblence of randomness.  For example, on a 32 bit machine,
rand() returns strictly alternating even and odd numbers!  (At least this
was true on a VAX....)

	-P.  (not the Peter referred to above!)
************************f*u*cn*rd*ths*u*cn*gt*a*gd*jb**************************
Peter S. Shenkin, Department of Chemistry, Barnard College, New York, NY  10027
(212)854-1418  shenkin@cunixc.cc.columbia.edu(Internet)  shenkin@cunixc(Bitnet)