[fpc-pascal] Dynamic arrays performance test.

Jonas Maebe jonas at zeus.ugent.be
Wed Mar 2 11:05:50 CET 2005

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.


More information about the fpc-pascal mailing list