[Dailydave] Why you care about this sort of Python bug.

[Florian Weimer]

* Michel Arboi:

>>  The time should grow only by O(n^2), which is still slow enough :)
>
> It seems that the execution time is roughly n^2 * 2*10^(-5)
> Strange...

Not really.  It's proportional to the number of characters copied.
Python does not create string slices behind your back (at least in
certain popular implementations), unlike say Java.