algorithm to find prime numbers less than 100
Answers
Answered by
3
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, 2.
Answered by
6
Answer:
ok...sure....
Explanation:
sure. .......
Similar questions