PE10 asks you to sum all the primes below 2 million. I've written the program with my old prime finder function but it's apparent I'll need a smarter primer finder. I can sum all the primes below 1 million in a reasonable amount of time (under a minute) but I left it running for the 2 million sum for a while and it's taking too long and really heating up my laptop.
There is a good prime finding solution using recursion I was shown once that I need to figure out for myself. Time get a pencil and paper.
No comments:
Post a Comment