Use array slicing to provide ~30-35x improvement with pure python

[koog1000]

Description

Use python array slicing to improve performance. No additional libraries, follows same structure as solution 1. Syntactically it is more difficult to read, but functionally does exactly the same thing.

• [x] I read the contribution guidelines in CONTRIBUTING.md.
• [x] I placed my solution in the correct solution folder.
• ~[ ] I added a README.md with the right badge(s).~ Not applicable
• ~[ ] I added a Dockerfile that builds and runs my solution.~ Not applicable
• [x] I selected drag-race as the target branch.
• [x] All code herein is licensed compatible with BSD-3.

[rbergen]

@davepl I can confirm an increase from 22 iterations per 5 seconds to 483 iterations per 5 seconds on my machine, so approximately 22-fold. Do you have any objections to merging this change to your Python solution?

[davepl]

I’ll defer to the Master of Primes on this one, Rutger!

On Jun 22, 2023, at 7:33 AM, Rutger van Bergen @.***> wrote:

@davepl https://github.com/davepl I can confirm an increase from 22 iterations per 5 seconds to 483 iterations per 5 seconds on my machine, so approximately 22-fold. Do you have any objections to merging this change to your Python solution?

— Reply to this email directly, view it on GitHub https://github.com/PlummersSoftwareLLC/Primes/pull/929#issuecomment-1602748796, or unsubscribe https://github.com/notifications/unsubscribe-auth/AA4HCF5BICD3NKWG2LV6SL3XMRJR7ANCNFSM6AAAAAAZLALXLY. You are receiving this because you were mentioned.

[rbergen]

I'll take that as a "no objections" 😄