[fpc-pascal] Dynamic arrays performance test.

Agustin Barto abarto at gmail.com
Wed Mar 2 13:07:24 CET 2005

On Wed, 2 Mar 2005 11:05:50 +0100, Jonas Maebe <jonas at zeus.ugent.be> 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


More information about the fpc-pascal mailing list