On Wed, 2 Mar 2005 11:05:50 +0100, Jonas Maebe <[EMAIL PROTECTED]> wrote: > > 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
Bingo. That was it. Now the fpc version is at least as fast as the Delphi version on the worst case and twice as fast using dynamic arrays. Agustin _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal
