Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^9: Number functions.. primes (ugly code runs faster)

by danaj (Friar)
on May 08, 2015 at 03:33 UTC ( [id://1126053] : note . print w/replies, xml ) Need Help??


in reply to Re^8: Number functions.. primes (ugly code runs faster)
in thread Number functions I have lying around

On memory footprint, it's important if using it for just the count where there is no array. Also for cases where we hold onto the string for later use in walking primes without resieving or storing the array. However, even doubling the string memory still results in >10x less memory than the array versions.

Thanks re posting. Given the licensing, I thought it was prudent to ask.