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)
• [x] New feature/question
• [x] This change requires a documentation update
• [ ] Bookmark link

Checklist:

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