add: sieve of eratosthenes. #133
Description
Describe the algorithm/code
Add code for implementation of sieve of eratosthenes.
The sieve of Eratosthenes is an algorithm used to find prime numbers up to any given limit n. It was introduced by the Greek mathematician Eratosthenes.
This code should be added in a new directory named Math
Do you want to work on this feature?
- I am willing to implement this feature.