Neoalgo: Sieve of Eratosthenes method, for computing prime number

[keshav304]

Algorithm:
In mathematics, the sieve of Eratosthenes is an ancient algorithm for finding all prime numbers up to any given limit.

It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the first prime number,

The multiples of a given prime are generated as a sequence of numbers starting from that prime, with a constant difference between them that is equal to that prime.

This is the sieve's key distinction from using trial division to sequentially test each candidate number for divisibility by each prime.

Languages Supported:
Python.

• C [@atarax665 ]
• C++ [ Assigned to @asaxena012 ]
• Java [@Himanshu70565 ]
• Javascript
• Python [ Assigned to @keshav304 ]

I would like to work on this issue using Python.

[asaxena012]

@HarshCasper @ricardoprins Please assign this issue to me in C++. Thanks.

[HarshCasper]

Thanks for making this Issue @keshav304 and carrying the true spirit of Open-Source 👀

I have assigned the Issue in C++ to @asaxena012 and in Python to @keshav304. You can start working on it now.

[Himanshu70565]

@HarshCasper I would like to work in java.

[atarax665]

I would like to take this issue in C.

[ricardoprins]

Whoever is working on this, you'll get a special mention if you implement not only the original sieve, but also some of its variations :D

[ricardoprins]

@Himanshu70565 and @atarax665 , game on!

[github-actions[bot]]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions!