Tremendous slowdown due to garbage collection

["Martin v. Löwis"]

> I still don't see what is so good about defaults that lead to O(N*N)
> computation for a O(N) problem, and I like Amaury's suggestion a lot,
> so I would like to see comments on its disadvantages. Please don't
> tell me that O(N*N) is good enough. For N>1E7 it isn't.

Please understand that changing the defaults will *not* affect the
asymptotic complexity. If your application shows O(N*N), then,
multiplying each value in the gc frequency with 1000, your application
might run faster, but it will *still* run at O(N*N).

Regards,
Martin