i have used sieve of Eratosthenes Update prime_numbers.py #12088
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
basically let assum we have [1...6] so it is obvious that if 6 isdiv by 6 then it can't be a prime number which will result less time complexcity
Describe your change:
All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
Fix a bug or typo in an existing algorithm?
Checklist: