- Sieve of Erastosthenes optimized to the max - 1 Update
| Tim Rentsch <tr.17687@z991.linuxsc.com>: Jan 13 09:31PM -0800 >> Does that all make sense? > Right now, no. But that's me. I'll flag it to read again when I've > had a better night's sleep. I'm posting to nudge you into looking at this again, if you haven't already. I have now had a chance to get your source and run some comparisons. A program along the lines I outlined can run much faster than the code you posted (as well as needing less memory). A good target is to find all primes less than 1e11, which needs less than 4gB of ram. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.lang.c+++unsubscribe@googlegroups.com. |
No comments:
Post a Comment