Finding prime number upto a certain range by sieve of eratosthenes

[harshlohia11]

Description

Please include a summary of the change and which issue is fixed or what question/feature you have added.

Fixes # (issue)

A algorithm to reduce time complexity.
Finding prime number upto a certain range by sieve of eratosthenes

Please delete options that are not relevant.

• Bug fix (non-breaking change which fixes an issue)
• New feature/question
• This change requires a documentation update
• Bookmark link

Checklist:

• My code follows the style guidelines of this project i.e. Pep8
• I have performed a self-review of my own code
• I have commented my code, particularly in hard-to-understand areas
• I have made corresponding changes to the documentation
• Any dependent changes have been merged and published in downstream modules
• I have squashed unnecessary commits

[prabhupant]

Please follow Pep-8 styling and naming conventions, like changing camelCase to snake_case