Re^2: optimization help

Thanks for looking closer. If you want to see what kinda amazing stuff this does turn generations up to 100, or 1000 even.

I thought Eval was computational complexity 0 - which is a unique feature of Perl. At least that what I remember from a Perl calls in Boulder where I met Tom.

It thinks. :)

Comment on Re^2: optimization help

Replies are listed 'Best First'.
Re^3: optimization help by samtregar (Abbot) on Oct 15, 2007 at 23:04 UTC
Perl's eval() definitely is not a constant-time operation. It definitely varies with the length and complexity of its input. I'd imagine it's at least O(n) with n being the length of the input string, but it's probably O(nmjkl) with the definition of m, j, k and l left as an exercise for the reader. -sam	[reply]
Re^4: optimization help by GSF (Acolyte) on Oct 16, 2007 at 00:32 UTC
Alright I must have misunderstood something, which is par for the course when I'm involved. Thanks for the info Sam.	[reply]
Re^3: optimization help by GSF (Acolyte) on Oct 15, 2007 at 23:01 UTC
Oh yeah, finally and perhaps most importantly, its not my code.	[reply]