On 2 mrt 2005, at 07:29, Florian Klaempfl wrote:
- FPC's random is probably more complex
Indeed. I guess Delphi's is still a simple "(x * prime1) mod prime2" or so. FPC uses the Mersenne twister.
Jonas
_______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal
